VLDB 2026 Research / reviewers in the wild / expert
Yunkang Deng
dblp:408/0014
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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.
| Databases, data mining, and information retrieval
1 paper |
Recommender systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Recommender systems › graph-based recommendation
hypergraph-based recommendation |
1.0 | 1 | 2026 | Heterogeneous Hypergraph Enhanced Trust Recommendation in Mobile Social Networks · IEEE Trans. Mob. Comput. 2026 |
Recommender systems
social recommendation |
1.0 | 1 | 2026 | Heterogeneous Hypergraph Enhanced Trust Recommendation in Mobile Social Networks · IEEE Trans. Mob. Comput. 2026 |
Recommender systems › social recommendation
trust-based recommendation |
1.0 | 1 | 2026 | Heterogeneous Hypergraph Enhanced Trust Recommendation in Mobile Social Networks · IEEE Trans. Mob. Comput. 2026 |
Methods — techniques the papers use, named apart from their topics
random walk · 1.0metapath-based graph attention network · 1.0hypergraph convolution · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Heterogeneous Hypergraph Enhanced Trust Recommendation in Mobile Social NetworksabstractWith the widespread adoption of mobile devices, an increasing number of users are engaging in social interactions through these devices. Mobile social networks have thus emerged in response. Existing research has shown that utilizing mobile social relations can effectively enhance the performance of recommendation systems. However, most studies only exploit single social relations such as pairwise relations, overlooking the effect of high-order complexity of user relations which contain some potentially beneficial information. What's more, they ignore the impact of the trusters who provide some potential feedbacks in the mobile social network. Therefore, this paper proposes our framework H2TRec using hypergraph convolution in the pretraining stage to learn high-order neighbor information in the mobile social network and utilizing the metapath-based GAT to model users' bidirectional trust relations. First, mobile social communities are partitioned by random walk based on the fusion graph which consolidates all different nodes and relations. Second, each mobile social community is represented as a hyperedge to construct the hypergraph and the high-order neighbor prior knowledge is learned using hypergraph convolution. Third, implicit relations are mined and the metapath-based GAT is utilized to model the preferences of users and items. Notably, unlike previous work, we consider mobile users' out-degree and in-degree features, which enhance the user embeddings. Additionally, a loss term aiming to improve centrality is added to make the preference features of mobile social communities more prominent. Extensive experiments on five popular real-world datasets demonstrate that our H2TRec can improve precision compared with state-of-the-art methods. We release the source code athttps://github.com/kangkang-yun/H2TRec. Shenghao Liu, Yunkang Deng, Chenlu Zhu, Xianjun Deng, Wei Feng 0010, Laurence T. Yang, Jong Hyuk Park 0001 |
IEEE Trans. Mob. Comput. | 2 |