Yuwei Cao

Yuwei Cao

Auto-generated profile, based on publicly available information

Yuwei Cao

University of Illinois Chicago

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
25 January 2022 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
HPHao Peng
Hao Peng
RZRuitong Zhang
Ruitong Zhang
SLShaoning Li
Shaoning Li
YCYuwei Cao
Yuwei Cao
SPShirui Pan
Shirui Pan
PYPhilip S. Yu
Philip S. Yu
Detecting hot social events (e.g., political scandal, momentous meetings, natural hazards, etc.) from social messages is crucial as it highlights significant happenings to help people understand the real world. On account of the streaming nature of social messages, incremental social event detection models in acquiring, preserving, and updating messages over time have attracted great attention. However, the challenge is that the existing event detection methods towards streaming social messages are generally confronted with ambiguous events features, dispersive text contents, and multiple languages, and hence result in low accuracy and generalization ability. In this paper, we present a novel rein F orced, i ncremental and cross-li n gual social Event detection architecture, namely FinEvent , from streaming social messages. Concretely, we first model social messages into heterogeneous graphs integrating both rich meta-semantics and diverse meta-relations, and convert them to weighted multi-relational message graphs. Second, we propose a new reinforced weighted multi-relational graph neural network framework by using a Multi-agent Reinforcement Learning algorithm to select optimal aggregation thresholds across different relations/edges to learn social message embeddings. To solve the long-tail problem in social event detection, a balanced sampling strategy guided Contrastive Learning mechanism is designed for incremental social message representation learning. Third, a new Deep Reinforcement Learning guided density-based spatial clustering model is designed to select the optimal minimum number of samples required to form a cluster and optimal minimum distance between two clusters in social event detection tasks. Finally, we implement incremental social message representation learning based on knowledge preservation on the graph neural network and achieve the transferring cross-lingual social event detection. We conduct extensive experiments to evaluate the FinEvent on Twitter streams, demonstrating a significant and consistent improvement in model quality with 14%–118%, 8%–170%, and 2%–21% increases in performance on offline, online, and cross-lingual social event detection tasks.

23 April 2021 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JLJianxin Li
Jianxin Li
HPHao Peng
Hao Peng
YCYuwei Cao
Yuwei Cao
YDYingtong Dou
Yingtong Dou
HZHekai Zhang
Hekai Zhang
LHLifang He
Lifang He
GNNs have been widely used in deep learning on graphs. They learn effective node representations. However, most methods ignore the heterogeneity. Methods designed for heterogeneous graphs, on the other hand, fail to learn complex semantic representations because they only use meta-paths instead of meta-graphs. Furthermore, they cannot fully capture the content-based correlations, as they either do not use the self-attention mechanism or only use it to consider the immediate neighbors of each node, ignoring the higher-order neighbors. We propose a novel Higher-order Attribute-Enhancing (HAE) framework enhancing node embedding in a layer-by-layer manner. Under the HAE framework, we propose a Higher-order Attribute-Enhancing GNN (HAE\textsubscript{GNN}) for heterogeneous network embeding. HAE\textsubscript{GNN} simultaneously incorporates meta-paths and meta-graphs for rich, heterogeneous semantics, and leverages the self-attention mechanism to explore content-based nodes' interactions. The unique higher-order architecture of HAE\textsubscript{GNN} allows examining the first-order as well as higher-order neighborhoods. Moreover, HAE\textsubscript{GNN} shows good explainability as it learns the importances of different meta-paths and meta-graphs. HAE\textsubscript{GNN} is also memory-efficient, for it avoids per meta-path based matrix calculation. Experimental results not only show HAE\textsubscript{GNN}'s superior performance against the state-of-the-art methods in node classification, node clustering, and visualization, but also demonstrate its superiorities in terms of memory efficiency and explainability.

1 January 2024
Verified
Conference Paper
Open access
PDF file
YCYuwei Cao
Yuwei Cao
NMNikhil Mehta
Nikhil Mehta
XYXinyang Yi
Xinyang Yi
RKRaghunandan Hulikal Keshavan
Raghunandan Hulikal Keshavan
LHLukasz Heldt
Lukasz Heldt
MSMaheswaran Sathiamoorthy
Maheswaran Sathiamoorthy
Yuwei Cao, Nikhil Mehta, Xinyang Yi, Raghunandan Hulikal Keshavan, Lukasz Heldt, Lichan Hong, Ed Chi, Maheswaran Sathiamoorthy. Findings of the Association for Computational Linguistics: NAACL 2024. 2024.

14 September 2023
Verified
Conference Paper
Open access
YCYuwei Cao
Yuwei Cao
LYLiangwei Yang
Liangwei Yang
CWChen Wang
Chen Wang
Zhiwei LiuZhiwei Liu
Zhiwei Liu
HPHao Peng
Hao Peng
PYPhilip S. Yu
Philip S. Yu
Recommendation systems suffer in the strict cold-start (SCS) scenario, where the user-item interactions are entirely unavailable. The well-established, dominating identity (ID)-based approaches completely fail to work. Cold-start recommenders, on the other hand, leverage item contents (brand, title, descriptions, etc.) to map the new items to the existing ones. However, the existing SCS recommenders explore item contents in coarse-grained manners that introduce noise or information loss. Moreover, informative data sources other than item contents, such as users’ purchase sequences and review texts, are largely ignored. In this work, we explore the role of the fine-grained item attributes in bridging the gaps between the existing and the SCS items and pre-train a knowledgeable item-attribute graph for SCS item recommendation. Our proposed framework, ColdGPT, models item-attribute correlations into an item-attribute graph by extracting fine-grained attributes from item contents. ColdGPT then transfers knowledge into the item-attribute graph from various available data sources, i.e., item contents, historical purchase sequences, and review texts of the existing items, via multi-task learning. To facilitate the positive transfer, ColdGPT designs specific submodules according to the natural forms of the data sources and proposes to coordinate the multiple pre-training tasks via unified alignment-and-uniformity losses. Our pre-trained item-attribute graph acts as an implicit, extendable item embedding matrix, which enables the SCS item embeddings to be easily acquired by inserting these items into the item-attribute graph and propagating their attributes’ embeddings. We carefully process three public datasets, i.e., Yelp, Amazon-home, and Amazon-sports, to guarantee the SCS setting for evaluation. Extensive experiments show that ColdGPT consistently outperforms the existing SCS recommenders by large margins and even surpasses models that are pre-trained on 75 - 224 times more, cross-domain data on two out of four datasets. Our code and pre-processed datasets for SCS evaluations are publicly available to help future SCS studies.

1 January 2025
Verified
Conference Paper
Open access
PDF file
DYDayu Yang
Dayu Yang
ASAntoine Simoulin
Antoine Simoulin
XQXin Qian
Xin Qian
XLXiaoyi Liu
Xiaoyi Liu
YCYuwei Cao
Yuwei Cao
GYGrey Yang
Grey Yang
Dayu Yang, Antoine Simoulin, Xin Qian, Xiaoyi Liu, Yuwei Cao, Zhaopu Teng, Grey Yang. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations). 2025.

2 March 2024 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
Chaochao ChenChaochao Chen
Chaochao Chen
FZFei Zheng
Fei Zheng
JCJamie Cui
Jamie Cui
YCYuwei Cao
Yuwei Cao
Guanfeng LiuGuanfeng Liu
Guanfeng Liu
JZJun Zhou
Jun Zhou