Kai Yin

Kai Yin

Auto-generated profile, based on publicly available information

Kai Yin

School of Computer Science, Wuhan University, Wuhan, China

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

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

Representative Publications

View All Publications
1 January 2026 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
KYKai Yin
Kai Yin
YZYuxiang Zhao
Yuxiang Zhao
RWRuiting Wang
Ruiting Wang
XYXinxin Ye
Xinxin Ye
TGTing Gan
Ting Gan
ZLZongpeng Li
Zongpeng Li

1 November 2026 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
KYKai Yin
Kai Yin
YZYuxiang Zhao
Yuxiang Zhao
HCHao Chi
Hao Chi
HHHao Huang
Hao Huang
Hypergraph modeling of higher-order interactions is essential in fields such as emerging consumer electronics ecosystems. However, robust hypergraph representation learning remains challenging due to the complexity of multi-way relationships and the prevalence of structural noise. Although conventional Hypergraph Neural Networks (HGNNs) often incorporate attention mechanisms, they typically rely on local feature aggregation over the observed incidence structure. This dependence can limit their ability to learn noise-invariant structural representations, rendering the models vulnerable to structural perturbations and distribution shifts. To address these limitations, we propose Importance-aware Hypergraph Contrastive Learning (IHCL), a robust, generative-driven framework that integrates importance-guided structural perturbations with contrastive learning. IHCL quantifies hyperedge importance by combining four complementary signals: hyperedge degree, intra-edge feature variance, structural centrality, and feature centrality. Guided by these importance scores, IHCL progressively masks noise-sensitive hyperedges and enforces representation consistency between the original and generatively perturbed hypergraphs through contrastive learning. By effectively filtering out noisy connections while preserving discriminative higher-order patterns, IHCL substantially improves robustness of complex interaction systems. Theoretically, we show that the proposed importance-aware masking reduces expected representation shift and yields a tighter InfoNCE-based mutual-information lower bound than random masking under the same budget. Extensive experiments on eight topologically complex stress-test datasets demonstrate that IHCL outperforms state-of-the-art baselines, exhibiting superior stability under structural noise and diverse data distributions.

12 April 2026
Verified
Conference Paper
Open access
ZZZhigao Zheng
Zhigao Zheng
KYKai Yin
Kai Yin
YKYaowen Kuang
Yaowen Kuang
TWTao Wang
Tao Wang
YCYahong Chen
Yahong Chen
HHHao Huang
Hao Huang