Zhizhuo Yin

Zhizhuo Yin

Auto-generated profile, based on publicly available information

Zhizhuo Yin

Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 December 2023 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
ZYZhizhuo Yin
Zhizhuo Yin
KHKai Han
Kai Han
PWPengzi Wang
Pengzi Wang
XZXi Zhu
Xi Zhu
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.

22 November 2024
Verified
Conference Paper
Open access
ZZZhuoran Zhao
Zhuoran Zhao
ZYZhizhuo Yin
Zhizhuo Yin
JSJia Sun
Jia Sun
PHPan Hui
Pan Hui

17 August 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
ZYZhizhuo Yin
Zhizhuo Yin
KHKai Han
Kai Han
PWPengzi Wang
Pengzi Wang
HHHaibing Hu
Haibing Hu
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.

13 May 2024
Verified
Conference Paper
Open access
YZYiming Zhu
Yiming Zhu
ZYZhizhuo Yin
Zhizhuo Yin
GTGareth Tyson
Gareth Tyson
EHEhsan-Ul Haq
Ehsan-Ul Haq
LLLik Hang Lee
Lik Hang Lee
PHPan Hui
Pan Hui
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.

18 February 2021 in Proceedings of the ACM on Measurement and Analysis of Computing Systems
Verified
Journal Article
Open access
KHKai Han
Kai Han
SCShuang Cui
Shuang Cui
TZTianshuai Zhu
Tianshuai Zhu
EZEnpei Zhang
Enpei Zhang
BWBenwei Wu
Benwei Wu
HHe Huang
He Huang
Data summarization, i.e., selecting representative subsets of manageable size out of massive data, is often modeled as a submodular optimization problem. Although there exist extensive algorithms for submodular optimization, many of them incur large computational overheads and hence are not suitable for mining big data. In this work, we consider the fundamental problem of (non-monotone) submodular function maximization with a knapsack constraint, and propose simple yet effective and efficient algorithms for it. Specifically, we propose a deterministic algorithm with approximation ratio 6 and a randomized algorithm with approximation ratio 4, and show that both of them can be accelerated to achieve nearly linear running time at the cost of weakening the approximation ratio by an additive factor of ε. We then consider a more restrictive setting without full access to the whole dataset, and propose streaming algorithms with approximation ratios of 8+ε and 6+ε that make one pass and two passes over the data stream, respectively. As a by-product, we also propose a two-pass streaming algorithm with an approximation ratio of 2+ε when the considered submodular function is monotone. To the best of our knowledge, our algorithms achieve the best performance bounds compared to the state-of-the-art approximation algorithms with efficient implementation for the same problem. Finally, we evaluate our algorithms in two concrete submodular data summarization applications for revenue maximization in social networks and image summarization, and the empirical results show that our algorithms outperform the existing ones in terms of both effectiveness and efficiency.