ZYZikai Yin

Zikai Yin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Zikai Yin has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    DynLLM: When Large Language Models Meet Dynamic Graph-based Recommendation

    by Ziwei Zhao, Fake Lin, Xi Zhu, Zhi Zheng, Tong Xu, Shitian Shen, Xueying Li, Zikai Yin, Enhong Chen

    Recommendation systems have become ubiquitous tools in online platforms, providing personalized suggestions based on user–item interactions. To capture the dynamic higher-order connections between users and items, recommendation approaches based on dynamic graphs have garnered significant attention from researchers. However, existing recommendation methods based on dynamic graphs are often limited by data sparsity, which prevents them from achieving satisfactory performance. Fortunately, the rapid development of large language models (LLMs) with powerful text generation capabilities and extensive domain knowledge has offered new possibilities for addressing this challenge. However, how to effectively integrate LLMs with dynamic graphs remains unexplored. To bridge this gap, in this article, we propose a novel framework, that is, DynLLM, for applying LLMs to dynamic graph-based recommendation methods. Specifically, DynLLM harnesses the power of LLMs to generate multi-faceted user profiles based on the rich textual features of historical purchase records, which in turn supplement and enrich the underlying relationships between users and items. Along this line, to fuse the multi-faceted profiles with temporal graph embedding, we engage LLMs to derive corresponding profile embeddings and further employ a distilled attention mechanism to refine the LLM-generated profile embeddings for alleviating noisy signals, while also assessing and adjusting the relevance of each distilled facet embedding for seamless integration with temporal graph embedding from continuous time dynamic graphs (CTDGs). Extensive experiments on three real datasets have validated the superior improvements of DynLLM over a wide range of state-of-the-art baseline methods. The implementation code is available online at https://github.com/meteor-gif/DynLLM .


  • Roll Call Vote Prediction With Graph Reconstruction and Attention-Based Pruning

    by Jiayue Chen, Zikai Yin, Ziwei Zhao, Fake Lin, Zhi Zheng, Suojuan Zhang, Tong Xu, Yang Wang, Enhong Chen

    Roll call vote prediction is a research field in quantitative political science that is crucial for understanding the legislative process and assessing the impact of political decisions. Much of the current work incorporates contextual information about legislation and legislators, relying on historical voting data to learn about legislation and preferences of legislators. However, these efforts have paid insufficient attention to characterizing the important role of cosponsors in legislation. In practical scenarios, whether a legislator votes for or against a bill is largely related to the cosponsors. To address the above challenge, in this article, we propose a group enhanced roll call vote prediction model, which considers cosponsors as a group. Specifically, we first reconstruct the historical cosponsorship network to obtain an accurate graph of relationships among legislators, and we utilize a GNN to obtain the preferences of legislators. Then, we propose an individual aggregation method to obtain the representation of groups and we further employ the BERT model to obtain the representation of legislative texts. We further integrate these representations by attention mechanisms to gain the final representation of legislation. It is worth mentioning that in the group representation component, considering the large size of some groups and the significant differences among group members, we apply self-attention mechanism within the group and prune members based on attention scores. Finally, we input the obtained representations of legislation and legislators into an MLP layer to obtain the final voting results of legislators on the legislation. Extensive experiments conducted on real-world datasets demonstrate the competitiveness of our model compared to state-of-the-art baseline methods.

  • Open Access

    Multi-Behavior Recommendation with Personalized Directed Acyclic Behavior Graphs

    by Xi Zhu, Fake Lin, Ziwei Zhao, Tong Xu, Xiangyu Zhao, Zikai Yin, Xueying Li, Enhong Chen

    A well-developed recommendation system can not only leverage multi-typed interactions (such as page view , add-to-cart , and purchase ) to better identify user preferences but also demonstrate high performance, low complexity, and strong interpretability. However, many existing solutions for multi-behavior recommendation fall short of intuitive modeling of real-world scenarios, leading to overly complex models with massive parameters and cumbersome components. In particular, they share two critical limitations: (1) Some pioneering models are built upon the strict assumption of cascade effects across behaviors, which contradicts multifarious behavior paths in practical applications. (2) Existing approaches fail to explicitly capture the unique idiosyncrasies of users and even neglect the inherent nature of items involved in the multi-behavior interactions. To this end, we propose a novel Directed Acyclic Graph Convolutional Network (DA-GCN) for the multi-behavior recommendation task. Specifically, we pinpoint the partial order relations within the monotonic behavior chain and extend it to personalized directed acyclic behavior graphs to exploit behavior dependencies. Then, a GCN-based directed edge encoder is employed to distill rich collaborative signals embodied by each directed edge. In light of the information flows over the directed acyclic structure, we propose an attentive aggregation module to gather messages from all potential antecedent behaviors, representing distinct perspectives to understand the terminated behavior. Thus, we obtain comprehensive representations for the follow-up behavior through learnable distributions over its preceding behaviors, explicitly reflecting personalized interactive patterns of users and underlying properties of items simultaneously. Finally, we design a customized multi-task learning objective for flexible joint optimization. Extensive experiments on public benchmarking datasets fully demonstrate the superiority of DA-GCN with significant performance improvement and computational efficiency over a wide range of state-of-the-art methods. Our code is available at https://github.com/xizhu1022/DA-GCN .


  • Adversarial Attack and Defense on Discrete Time Dynamic Graphs

    by Ziwei Zhao, Yu Yang, Zikai Yin, Tong Xu, Xi Zhu, Fake Lin, Xueying Li, Enhong Chen

    Graph learning methods have achieved remarkable performance in various domains such as social recommendation, financial fraud detection, and so on. In real applications, the underlying graph is often dynamically evolving and thus, some recent studies focus on integrating the temporal topology information of graphs into the GNN for learning graph embedding. However, the robustness of training GNNs for dynamic graphs has not been discussed so far. The major reason is how to attack dynamic graph embedding still remains largely untouched, let alone how to defend against the attacks. To enable robust training of GNNs for dynamic graphs, in this paper, we investigate the problem of how to generate attacks and defend against attacks for dynamic graph embedding. Attacking dynamic graph embedding is more challenging than attacking static graph embedding as we need to understand the temporal dynamics of graphs as well as its impact on the embedding and the injected perturbations should be distinguished from the natural evolution. In addition, the defense is very challenging as the perturbations may be hidden within the natural evolution. To tackle these technical challenges, in this paper, we first develop a novel gradient-based attack method from an optimization perspective to generate perturbations to fool dynamic graph learning methods, where a key idea is to use gradient dynamics to attack the natural dynamics of the graph. Further, we borrow the idea of the attack method and integrate it with adversarial training to train a more robust dynamic graph learning method to defend against hand-crafted attacks. Finally, extensive experiments on two real-world datasets demonstrate the effectiveness of the proposed attack and defense method, where our defense method not only achieves comparable performance on clean graphs but also significantly increases the defense performance on attacked graphs.


  • Open Access

    DynLLM: When Large Language Models Meet Dynamic Graph Recommendation

    by Ziwei Zhao, Fake Lin, Xi Zhu, Zhi Zheng, Tong Xu, Shitian Shen, Xueying Li, Zikai Yin, Enhong Chen

    Last year has witnessed the considerable interest of Large Language Models (LLMs) for their potential applications in recommender systems, which may mitigate the persistent issue of data sparsity. Though large efforts have been made for user-item graph augmentation with better graph-based recommendation performance, they may fail to deal with the dynamic graph recommendation task, which involves both structural and temporal graph dynamics with inherent complexity in processing time-evolving data. To bridge this gap, in this paper, we propose a novel framework, called DynLLM, to deal with the dynamic graph recommendation task with LLMs. Specifically, DynLLM harnesses the power of LLMs to generate multi-faceted user profiles based on the rich textual features of historical purchase records, including crowd segments, personal interests, preferred categories, and favored brands, which in turn supplement and enrich the underlying relationships between users and items. Along this line, to fuse the multi-faceted profiles with temporal graph embedding, we engage LLMs to derive corresponding profile embeddings, and further employ a distilled attention mechanism to refine the LLM-generated profile embeddings for alleviating noisy signals, while also assessing and adjusting the relevance of each distilled facet embedding for seamless integration with temporal graph embedding from continuous time dynamic graphs (CTDGs). Extensive experiments on two real e-commerce datasets have validated the superior improvements of DynLLM over a wide range of state-of-the-art baseline methods.

  • Open Access

    Time-interval Aware Share Recommendation via Bi-directional Continuous Time Dynamic Graphs

    by Ziwei Zhao, Xi Zhu, Tong Xu, Aakas Lizhiyu, Yu Yu, Xueying Li, Zikai Yin, Enhong Chen


  • Competition Analysis on Enterprise Ecosystems via Multiview Relational Hypergraph Embedding

    by Zikai Yin, Tong Xu, Ziwei Zhao, Aakas Zhiyuli, Xueying Li, Enhong Chen

    Enterprise competition analysis has long been treated as a crucial task of management science, which can reveal pertinent information about market saturation and business opportunities to support the decision-making process of entrepreneurs and investors. Recently, with the development of graph representation techniques, enterprises could be now formulated in a novel graph-oriented perspective to model their cooperation and competition in a directional graph. However, these prior arts mainly treat the enterprises as individual nodes, while the ecosystems, i.e., enterprise groups formed based on their common interests, and consequent interaction effects have been largely ignored. To address this issue, in this article, by adapting the concept of hypergraph to describe enterprise ecosystems, we propose a novel multiview enterprise relation network (MERN) framework for enterprise competition analysis. Specifically, we first put forward a hypertranslating embedding (HTransE) algorithm inspired by translation distance models for the hyperrelation embedding of ecosystems. Meanwhile, a relational graph convolutional network (RGCN) is designed for ordinary relation embedding, e.g., supplier, client, or competitor. Afterward, considering the commercial diversity in ecosystems, which means that different enterprises may focus on different industry fields, we propose an industry trend embedding module to describe industry distribution and development trend factors for each enterprise. Finally, we apply the self-attention mechanism to integrate these three modules and adapt the bilinear model DistMult for competition link analysis. Extensive experiments on a real-world dataset validate that our solution can achieve better performance compared with several competitive baselines.


  • Matching of social events and users: a two-way selection perspective

    by Zikai Yin, Tong Xu, Hengshu Zhu, Chen Zhu, Enhong Chen, Hui Xiong