Chen Huang

Chen Huang

Auto-generated profile, based on publicly available information

Chen Huang

College of Computer Science, Sichuan University, Chengdu, China

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
23 June 2025
Verified
Conference Paper
Open access
YZYifan Zhang
Yifan Zhang
CHChen Huang
Chen Huang
ZKZachary Karas
Zachary Karas
TNThuy Dung Nguyen
Thuy Dung Nguyen
KLKevin Leach
Kevin Leach
YHYu Huang
Yu Huang

13 May 2024
Verified
Conference Paper
Open access
CHChen Huang
Chen Huang
HLHaoyang Li
Haoyang Li
YZYifan Zhang
Yifan Zhang
WLWenqiang Lei
Wenqiang Lei
JLJiancheng Lv
Jiancheng Lv
The vanilla Graph Convolutional Network (GCN) uses a low-pass filter to extract low-frequency signals from graph topology, which may lead to the over-smoothing problem when GCN goes deep. To this end, various methods have been proposed to create an adaptive filter by incorporating an extra filter (e.g., a high-pass filter) extracted from the graph topology. However, these methods heavily rely on topological information and ignore the node attribute space, which severely sacrifices the expressive power of the deep GCNs, especially when dealing with disassortative graphs. In this paper, we propose a cross-space adaptive filter, called CSF, to produce the adaptive-frequency information extracted from both the topology and attribute spaces. Specifically, we first derive a tailored attribute-based high-pass filter that can be interpreted theoretically as a minimizer for semi-supervised kernel ridge regression. Then, we cast the topology-based low-pass filter as a Mercer's kernel within the context of GCNs. This serves as a foundation for combining it with the attribute-based filter to capture the adaptive-frequency information. Finally, we derive the cross-space filter via an effective multiple-kernel learning strategy, which unifies the attribute-based high-pass filter and the topology-based low-pass filter. This helps to address the over-smoothing problem while maintaining effectiveness. Extensive experiments demonstrate that CSF not only successfully alleviates the over-smoothing problem but also promotes the effectiveness of the node classification task. Our code is available at https://github.com/huangzichun/Cross-Space-Adaptive-Filter.

4 June 2026 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
CHChen Huang
Chen Huang
XYXinwei Yang
Xinwei Yang
YDYang Deng
Yang Deng
WLWenqiang Lei
Wenqiang Lei
JLJiancheng Lv
Jiancheng Lv
TCTat-Seng Chua
Tat-Seng Chua
Recent efforts have aimed to improve AI models in legal case matching by integrating legal domain knowledge. However, successful legal case matching requires the tacit knowledge of legal practitioners, which is difficult to verbalize and encode into models. This emphasizes the crucial role of involving legal practitioners in high-stakes legal case matching. To address this, we propose a collaborative matching framework called Co-Matching , which encourages both the model and the legal practitioner to participate in the matching process, integrating tacit knowledge. Unlike existing methods that rely solely on the model, Co-Matching allows both the legal practitioner and the model to determine key sentences and then combine them probabilistically. Co-Matching introduces a method called ProtoEM to estimate human decision uncertainty, facilitating the probabilistic combination. Experimental results demonstrate that Co-Matching consistently outperforms existing legal case matching methods, delivering significant performance improvements over human- and model-based matching in isolation (on average, +5.51% and +8.71%, respectively). Further analysis shows that Co-Matching also ensures better human-model collaboration effectiveness. Our study represents an effort in human-model collaboration for the legal case matching task, marking a milestone for future collaborative matching studies.