Zhizhuo Yin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Zhizhuo Yin has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Pan Hui
Hong Kong University of Science and Technology (Guangzhou)
7 shared publications - Kai Han
Shanghai University of Finance and Economics, Shanghai, China
5 shared publications - Ching Christie Pang
Hong Kong University of Science and Technology
3 shared publications - Jia Sun
The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China
3 shared publications - Shuang Cui
Soochow University, Suzhou, Jiangsu, China
3 shared publications - Benwei Wu
University of Science and Technology of China, Hefei, China
2 shared publications
Latest Publications
- Open Access
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Avatar-Agent: A Training-Free Multi-Agent Framework for Scalable, Efficient Generation of Long Digital Tutor Video
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessAvatar-Agent: A Training-Free Multi-Agent Framework for Scalable, Efficient Generation of Long Digital Tutor Video
- Open Access
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1904-1915
IMGNN: An Efficient, Effective and Generalizable Algorithm for Influence Maximization in Social Networks
Influence Maximization (IM) is a crucial problem in social network analysis and has been extensively studied. Traditional approaches rely on designing approximation algorithms using network sampling; however, these methods lack generalizability and depend on an explicit definition of the influence diffusion model as input. Recently, researchers have turned to deep learning methods to address the shortcomings of traditional IM algorithms, but current learning-based IM algorithms still suffer from severe deficiencies in scalability and generalizability. In this paper, we propose IMGNN, a simple, efficient, effective, and generalizable algorithm powered by graph neural networks. IMGNN is a learning-based IM algorithm with strong generalization capability that reduces the overhead of model retraining while also providing fast seed set inference speed. As a result, IMGNN achieves better performance in terms of both efficiency and effectiveness compared to existing IM algorithms. Its exceptional generalization capability also enables it to be trained on small-scale graphs and directly infer the seed node set for large-scale graphs. IMGNN achieves these advantages by adopting a novel design for feature construction and model training, utilizing features constructed from influence propagations over graphs with randomly skipped nodes. This approach enables IMGNN to avoid overfitting to specific network structures while employing a unique technique to improve time efficiency by training on smaller networks. We have conducted extensive experiments using real-world social networks with up to 40 million nodes, and the results strongly demonstrate the superiority of IMGNN in terms of influence spread, seed node set inference speed, and generalizability.
- 20 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1904-1915
Open AccessIMGNN: An Efficient, Effective and Generalizable Algorithm for Influence Maximization in Social Networks
Influence Maximization (IM) is a crucial problem in social network analysis and has been extensively studied. Traditional approaches rely on designing approximation algorithms using network sampling; however, these methods lack generalizability and depend on an explicit definition of the influence diffusion model as input. Recently, researchers have turned to deep learning methods to address the shortcomings of traditional IM algorithms, but current learning-based IM algorithms still suffer from severe deficiencies in scalability and generalizability. In this paper, we propose IMGNN, a simple, efficient, effective, and generalizable algorithm powered by graph neural networks. IMGNN is a learning-based IM algorithm with strong generalization capability that reduces the overhead of model retraining while also providing fast seed set inference speed. As a result, IMGNN achieves better performance in terms of both efficiency and effectiveness compared to existing IM algorithms. Its exceptional generalization capability also enables it to be trained on small-scale graphs and directly infer the seed node set for large-scale graphs. IMGNN achieves these advantages by adopting a novel design for feature construction and model training, utilizing features constructed from influence propagations over graphs with randomly skipped nodes. This approach enables IMGNN to avoid overfitting to specific network structures while employing a unique technique to improve time efficiency by training on smaller networks. We have conducted extensive experiments using real-world social networks with up to 40 million nodes, and the results strongly demonstrate the superiority of IMGNN in terms of influence spread, seed node set inference speed, and generalizability.
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Revolutionizing Education: Integrating Metaverse and the First AI Lecturers in Cross-Campus Higher Education
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessRevolutionizing Education: Integrating Metaverse and the First AI Lecturers in Cross-Campus Higher Education
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 249-255
Pinning “Reflection” on the Agenda: Investigating Reflection in Human–LLM Co-Creation for Creative Coding
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 249-255
Open AccessPinning “Reflection” on the Agenda: Investigating Reflection in Human–LLM Co-Creation for Creative Coding
- 25 May 2025
- Published by Springer Nature
- p. 105-124
Artificial Human Lecturers: Initial Findings from Asia’s First AI Lecturers in Class to Promote Innovation in Education
- 25 May 2025
- Published by Springer Nature
- p. 105-124
Artificial Human Lecturers: Initial Findings from Asia’s First AI Lecturers in Class to Promote Innovation in Education
- Open Access
- 22 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Embodied AI-Guided Interactive Digital Teachers for Education
- 22 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-8
Open AccessEmbodied AI-Guided Interactive Digital Teachers for Education
- Open Access
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 245-255
APT-Pipe: A Prompt-Tuning Tool for Social Data Annotation using ChatGPT
Recent research has highlighted the potential of LLMs, like ChatGPT, for performing label annotation on social computing data. However, it is already well known that performance hinges on the quality of the input prompts. To address this, there has been a flurry of research into prompt tuning --- techniques and guidelines that attempt to improve the quality of prompts. Yet these largely rely on manual effort and prior knowledge of the dataset being annotated. To address this limitation, we propose APT-Pipe, an automated prompt-tuning pipeline. APT-Pipe aims to automatically tune prompts to enhance ChatGPT's text classification performance on any given dataset. We implement APT-Pipe and test it across twelve distinct text classification datasets. We find that prompts tuned by APT-Pipe help ChatGPT achieve higher weighted F1-score on nine out of twelve experimented datasets, with an improvement of 7.01% on average. We further highlight APT-Pipe's flexibility as a framework by showing how it can be extended to support additional tuning mechanisms.
- 13 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 245-255
Open AccessAPT-Pipe: A Prompt-Tuning Tool for Social Data Annotation using ChatGPT
Recent research has highlighted the potential of LLMs, like ChatGPT, for performing label annotation on social computing data. However, it is already well known that performance hinges on the quality of the input prompts. To address this, there has been a flurry of research into prompt tuning --- techniques and guidelines that attempt to improve the quality of prompts. Yet these largely rely on manual effort and prior knowledge of the dataset being annotated. To address this limitation, we propose APT-Pipe, an automated prompt-tuning pipeline. APT-Pipe aims to automatically tune prompts to enhance ChatGPT's text classification performance on any given dataset. We implement APT-Pipe and test it across twelve distinct text classification datasets. We find that prompts tuned by APT-Pipe help ChatGPT achieve higher weighted F1-score on nine out of twelve experimented datasets, with an improvement of 7.01% on average. We further highlight APT-Pipe's flexibility as a framework by showing how it can be extended to support additional tuning mechanisms.
- 23 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (5) , 6087-6097
Spatial and Temporal User Interest Representations for Sequential Recommendation
In recent years, recommendation systems have become increasingly prevalent in various fields, facilitating quick access to the information users need. As a result, many models have been proposed to model user interests, leading to more accurate recommendation lists, superior user experience, and business value. However, characterizing the dynamically changing interests of users is a challenging task. User interests shift over time while maintaining some long-term interests, and at each time, users’ interests are diverse. To investigate the benefits of multidimensional interests for users, this article proposes to characterize user preferences based on their spatiotemporal interests. Utilizing temporal and spatial information is critical for improving recommendation accuracy. To achieve this, we present a novel approach called multilong short-term interest (MLSI) user representation for recommendation. This method extracts long-term and short-term interests of users from their behavioural sequences using decoupled self-supervised learning with different optimizers. Self-attention is then employed to capture the diverse interests of users through their behavioral sequences. Final, long-term and short-term interests, as well as diversified interests, are aggregated to represent user interests. Extensive experiments on real-world datasets show that MLSI not only outperforms state-of-the-art methods but also more effectively characterizes user interests, reflecting an improvement ranging from 5% to 20% across various metrics on multiple datasets.
- 23 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 11 (5) , 6087-6097
Spatial and Temporal User Interest Representations for Sequential Recommendation
In recent years, recommendation systems have become increasingly prevalent in various fields, facilitating quick access to the information users need. As a result, many models have been proposed to model user interests, leading to more accurate recommendation lists, superior user experience, and business value. However, characterizing the dynamically changing interests of users is a challenging task. User interests shift over time while maintaining some long-term interests, and at each time, users’ interests are diverse. To investigate the benefits of multidimensional interests for users, this article proposes to characterize user preferences based on their spatiotemporal interests. Utilizing temporal and spatial information is critical for improving recommendation accuracy. To achieve this, we present a novel approach called multilong short-term interest (MLSI) user representation for recommendation. This method extracts long-term and short-term interests of users from their behavioural sequences using decoupled self-supervised learning with different optimizers. Self-attention is then employed to capture the diverse interests of users through their behavioral sequences. Final, long-term and short-term interests, as well as diversified interests, are aggregated to represent user interests. Extensive experiments on real-world datasets show that MLSI not only outperforms state-of-the-art methods but also more effectively characterizes user interests, reflecting an improvement ranging from 5% to 20% across various metrics on multiple datasets.
- Open Access
- 30 December 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 42 (3) , 1-30
H3GNN: Hybrid Hierarchical HyperGraph Neural Network for Personalized Session-based Recommendation
Personalized Session-based recommendation (PSBR) is a general and challenging task in the real world, aiming to recommend a session’s next clicked item based on the session’s item transition information and the corresponding user’s historical sessions. A session is defined as a sequence of interacted items during a short period. The PSBR problem has a natural hierarchical architecture in which each session consists of a series of items, and each user owns a series of sessions. However, the existing PSBR methods can merely capture the pairwise relation information within items and users. To effectively capture the hierarchical information, we propose a novel hierarchical hypergraph neural network to model the hierarchical architecture. Moreover, considering that the items in sessions are sequentially ordered, while the hypergraph can only model the set relation, we propose a directed graph aggregator (DGA) to aggregate the sequential information from the directed global item graph. By attentively combining the embeddings of the above two modules, we propose a framework dubbed H3GNN (Hybrid Hierarchical HyperGraph Neural Network). Extensive experiments on three benchmark datasets demonstrate the superiority of our proposed model compared to the state-of-the-art methods, and ablation experiment results validate the effectiveness of all the proposed components.
- 30 December 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 42 (3) , 1-30
Open AccessH3GNN: Hybrid Hierarchical HyperGraph Neural Network for Personalized Session-based Recommendation
Personalized Session-based recommendation (PSBR) is a general and challenging task in the real world, aiming to recommend a session’s next clicked item based on the session’s item transition information and the corresponding user’s historical sessions. A session is defined as a sequence of interacted items during a short period. The PSBR problem has a natural hierarchical architecture in which each session consists of a series of items, and each user owns a series of sessions. However, the existing PSBR methods can merely capture the pairwise relation information within items and users. To effectively capture the hierarchical information, we propose a novel hierarchical hypergraph neural network to model the hierarchical architecture. Moreover, considering that the items in sessions are sequentially ordered, while the hypergraph can only model the set relation, we propose a directed graph aggregator (DGA) to aggregate the sequential information from the directed global item graph. By attentively combining the embeddings of the above two modules, we propose a framework dubbed H3GNN (Hybrid Hierarchical HyperGraph Neural Network). Extensive experiments on three benchmark datasets demonstrate the superiority of our proposed model compared to the state-of-the-art methods, and ablation experiment results validate the effectiveness of all the proposed components.
- 17 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1-12
Multi Global Information Assisted Streaming Session-Based Recommendation System
Streaming Session-Based Recommendation (SSBR) is a challenging problem as user preferences in sessions are continually drifting with sessions generated chronologically. In recent years, some SSBR models have been proposed to address this problem by reservoir technique and Graph Neural Networks (GNN) which help to preserve a representative sketch of the historical data and extract item transition information in sessions. However, there are two critical problems in existing methods: (1) most existing methods only focus on the local session information without exploiting the information of other sessions and users; (2) GNN models in existing SSBR methods are unable to capture the importance of different user features. To address the problems mentioned above, we propose a novel architecture named Global Item and User embedding Assisted Graph Neural Network (GIUA-GNN) for combining the global user and item information in an attentional manner with local session information for the recommendation. We also propose a novel architecture of graph neural network which utilizes the attention mechanism for better extracting the importance of different features of user embeddings named Bi-directed Attentional Graph Convolutional Network (BA-GCN). Extensive experiments on three different sizes of real-world datasets have been conducted to demonstrate the superiority of our model on metrics MRR and Recall.
- 17 August 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. PP (10414347) , 1-12
Multi Global Information Assisted Streaming Session-Based Recommendation System
Streaming Session-Based Recommendation (SSBR) is a challenging problem as user preferences in sessions are continually drifting with sessions generated chronologically. In recent years, some SSBR models have been proposed to address this problem by reservoir technique and Graph Neural Networks (GNN) which help to preserve a representative sketch of the historical data and extract item transition information in sessions. However, there are two critical problems in existing methods: (1) most existing methods only focus on the local session information without exploiting the information of other sessions and users; (2) GNN models in existing SSBR methods are unable to capture the importance of different user features. To address the problems mentioned above, we propose a novel architecture named Global Item and User embedding Assisted Graph Neural Network (GIUA-GNN) for combining the global user and item information in an attentional manner with local session information for the recommendation. We also propose a novel architecture of graph neural network which utilizes the attention mechanism for better extracting the importance of different features of user embeddings named Bi-directed Attentional Graph Convolutional Network (BA-GCN). Extensive experiments on three different sizes of real-world datasets have been conducted to demonstrate the superiority of our model on metrics MRR and Recall.