Demo Data from VLDB 2026 / reviewers in the wild / expert
Mingliang Yu
dblp:60/5440
· DBLP profile ↗
3ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Graph learning · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning
graph augmentation |
0.9 | 1 | 2025 | Critical Node-aware Augmentation for Hypergraph Contrastive Learning · IJCAI 2025 |
Machine learning › Graph learning › hypergraph learning
hypergraph contrastive learning |
0.9 | 1 | 2025 | Critical Node-aware Augmentation for Hypergraph Contrastive Learning · IJCAI 2025 |
Machine learning › Graph learning › hypergraph learning
hypergraph representation learning |
0.9 | 1 | 2025 | Critical Node-aware Augmentation for Hypergraph Contrastive Learning · IJCAI 2025 |
Methods — techniques the papers use, named apart from their topics
hyperedge prediction · 0.9contrastive learning · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Critical Node-aware Augmentation for Hypergraph Contrastive LearningabstractHypergraph contrastive learning enables effective representation learning for hypergraphs without requiring labels. However, existing methods typically rely on randomly deleting or replacing nodes during hypergraph augmentation, which may lead to the absence of critical nodes and further disrupt the higher-order structural relationships within augmented hypergraphs. To address this issue, we propose a Critical Node-aware hypergraph contrastive learning method, which is the first attempt to leverage hyperedge prediction to retain critical nodes and accordingly maintain the reliable higher-order structural relationships within augmented hypergraphs. Specifically, we first employ contrastive learning to align the augmented hypergraphs, and then generate hyperedge embeddings to characterize node representations and their structural correlations. During the hyperedge embedding encoding process, we introduce a hyperedge prediction discriminator to score these embeddings, which quantifies the nodes' contributions to identify the critical nodes and maintain the higher-order structural relationships within augmented hypergraphs. Compared with previous studies, our proposed method can effectively alleviate the erroneous deletion or replacement of critical nodes and steadily maintain the inherent structural relationships between original hypergraph and augmented hypergraphs, naturally guiding better hypergraph representations for downstream tasks. Extensive experiments on various tasks demonstrate that our method is significantly superior to state-of-the-art methods. Yuena Lin, Yipeng Wang 0001, Wenmao Liu, Mingliang Yu, Zhen Yang 0004, Gengyu Lyu |
IJCAI | 5 |
| 2025 | A Multi-Factor Collaborative Prediction for Review-based Recommendation
Tong Li 0001, Mingliang Yu, Shiqiu Yang, Zifang Tang, Zhen Yang 0004 |
RecSys | 3 |
| 2008 | Adaptive Connection Admission Control Algorithm for LTE SystemsabstractIn this paper, a resource allocation algorithm and a connection access control scheme (CAC) for LTE systems with heterogeneous services are proposed. The proposed allocation algorithm introduces a transmission guard interval which gives high priority to real-time (RT) service packets approaching the delay deadline. The proposed CAC can adaptively adjust the threshold according to the network condition. Simulation results show that the proposed CAC scheme can not only balance the ongoing connections of different classes of traffics but also be easy to reserve resource and support handover users potentially. Haipeng Lei, Mingliang Yu, Anjun Zhao, Yongyu Chang, Dacheng Yang |
VTC Spring | 2 |