Huachi Zhou

Huachi Zhou

Auto-generated profile, based on publicly available information

Huachi Zhou

The Hong Kong Polytechnic University, Hong Kong, Hong Kong

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
5 May 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
SZShuang Zhou
Shuang Zhou
Xiao HuangXiao Huang
Xiao Huang
NLNinghao Liu
Ninghao Liu
HZHuachi Zhou
Huachi Zhou
FCFu-Lai Chung
Fu-Lai Chung
LHLong-Kai Huang
Long-Kai Huang
Graph anomaly detection (GAD) has wide applications in real-world networked systems. In many scenarios, people need to identify anomalies on new (sub)graphs, but they may lack labels to train an effective detection model. Since recent semi-supervised GAD methods, which can leverage the available labels as prior knowledge, have achieved superior performance than unsupervised methods, one natural idea is to directly adopt a trained semi-supervised GAD model to the new (sub)graphs for testing. However, we find that existing semi-supervised GAD methods suffer from poor generalization issues, i.e., well-trained models could not perform well on an unseen area (i.e., not accessible in training) of the graph. Motivated by this, we formally define the problem of generalized graph anomaly detection that aims to effectively identify anomalies on both the training-domain graph(s) and the unseen test graph(s). Nevertheless, it is a challenging task since only limited labels are available, and the normal data distribution may differ between training and testing data. Accordingly, we propose a data augmentation method named AugAN ( Aug mentation for A nomaly and N ormal distributions) to enrich training data and adopt a customized episodic training strategy for learning with the augmented data. Extensive experiments verify the effectiveness of AugAN in improving model generalizability.

13 May 2024
Verified
Conference Paper
Open access
XWXuansheng Wu
Xuansheng Wu
HZHuachi Zhou
Huachi Zhou
YSYucheng Shi
Yucheng Shi
WYWenlin Yao
Wenlin Yao
Xiao HuangXiao Huang
Xiao Huang
NLNinghao Liu
Ninghao Liu
Recommendation systems help users find matched items based on their previous behaviors. Personalized recommendation becomes challenging in the absence of historical user-item interactions, a practical problem for startups known as the system cold-start recommendation. While existing research addresses cold-start issues for either users or items, we still lack solutions for system cold-start scenarios. To tackle the problem, we propose PromptRec, a simple but effective approach based on in-context learning of language models, where we transform the recommendation task into the sentiment analysis task on natural language containing user and item profiles. However, this naive approach heavily relies on the strong in-context learning ability emerged from large language models, which could suffer from significant latency for online recommendations. To solve the challenge, we propose to enhance small language models for recommender systems with a data-centric pipeline, which consists of: (1) constructing a refined corpus for model pre-training; (2) constructing a decomposed prompt template via prompt pre-training. They correspond to the development of training data and inference data, respectively. The pipeline is supported by a theoretical framework that formalizes the connection between in-context recommendation and language modeling. To evaluate our approach, we introduce a cold-start recommendation benchmark, and the results demonstrate that the enhanced small language models can achieve comparable cold-start recommendation performance to that of large models with only 17% of the inference time. To the best of our knowledge, this is the first study to tackle the system cold-start recommendation problem. We believe our findings will provide valuable insights for future works. The benchmark and implementations are available at https://github.com/JacksonWuxs/PromptRec.

18 July 2023
Verified
Conference Paper
Open access
HZHuachi Zhou
Huachi Zhou
HCHao Chen
Hao Chen
JDJunnan Dong
Junnan Dong
DZDaochen Zha
Daochen Zha
CZChuang Zhou
Chuang Zhou
Xiao HuangXiao Huang
Xiao Huang

1 January 2024
Verified
Conference Paper
Open access
PDF file
JDJunnan Dong
Junnan Dong
QZQinggang Zhang
Qinggang Zhang
HZHuachi Zhou
Huachi Zhou
DZDaochen Zha
Daochen Zha
PZPAI ZHENG
PAI ZHENG
Xiao HuangXiao Huang
Xiao Huang
Junnan Dong, Qinggang Zhang, Huachi Zhou, Daochen Zha, Pai Zheng, Xiao Huang. Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2024.

1 January 2025
Verified
Conference Paper
Open access
PDF file
HZHuachi Zhou
Huachi Zhou
JDJiahe Du
Jiahe Du
CZChuang Zhou
Chuang Zhou
CYChang Yang
Chang Yang
YXYilin Xiao
Yilin Xiao
Xiao HuangXiao Huang
Xiao Huang
Huachi Zhou, Jiahe Du, Chuang Zhou, Chang Yang, Yilin Xiao, Yuxuan Xie, Xiao Huang. Findings of the Association for Computational Linguistics: ACL 2025. 2025.

26 May 2023
Verified
Book Chapter
Closed access
PDF file
WLWentao Li
Wentao Li
HZHuachi Zhou
Huachi Zhou
JDJunnan Dong
Junnan Dong
QZQinggang Zhang
Qinggang Zhang
QLQing Li
Qing Li
Xiao HuangXiao Huang
Xiao Huang