Demo Data from EDBT 2026 / reviewers in the wild / expert
Jiadi Han
dblp:323/9655
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0001-6276-6691ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 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
hypergraph convolutional network |
0.6 | 1 | 2022 | DH-HGCN: Dual Homogeneity Hypergraph Convolutional Network for Multiple Social Recommendations · SIGIR 2022 |
Recommender systems
social recommendation |
0.6 | 1 | 2022 | DH-HGCN: Dual Homogeneity Hypergraph Convolutional Network for Multiple Social Recommendations · SIGIR 2022 |
Recommender systems
item relation modeling |
0.2 | 1 | 2022 | DH-HGCN: Dual Homogeneity Hypergraph Convolutional Network for Multiple Social Recommendations · SIGIR 2022 |
Methods — techniques the papers use, named apart from their topics
sentiment analysis · 0.6k-means clustering · 0.6hypergraph convolution · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Dual Homogeneity Hypergraph Motifs with Cross-view Contrastive Learning for Multiple Social RecommendationsabstractSocial relations are often used as auxiliary information to address data sparsity and cold-start issues in social recommendations. In the real world, social relations among users are complex and diverse. Widely used graph neural networks (GNNs) can only model pairwise node relationships and are not conducive to exploring higher-order connectivity, while hypergraph provides a natural way to model high-order relations between nodes. However, recent studies show that social recommendations still face the following challenges: 1) a majority of social recommendations ignore the impact of multifaceted social relationships on user preferences; 2) the item homogeneity is often neglected, mainly referring to items with similar static attributes have similar attractiveness when exposed to users that indicating hidden links between items; and 3) directly combining the representations learned from different independent views cannot fully exploit the potential connections between different views. To address these challenges, in this article, we propose a novel method DH-HGCN++ for multiple social recommendations. Specifically, dual homogeneity (i.e., social homogeneity and item homogeneity) is introduced to mine the impact of diverse social relations on user preferences and enrich item representations. Hypergraph convolution networks with motifs are further exploited to model the high-order relations between nodes. Finally, cross-view contrastive learning is proposed as an auxiliary task to jointly optimize the DH-HGCN++. Real-world datasets are used to validate the effectiveness of the proposed model, where we use sentiment analysis to extract comment relations and employ the k-means clustering algorithm to construct the item-item correlation graph. Experiment results demonstrate that our proposed method consistently outperforms the state-of-the-art baselines on Top-N recommendations. Jiadi Han, Yufei Tang, Yuhan Xia |
ACM Trans. Knowl. Discov. Data | 1 |
| 2022 | DH-HGCN: Dual Homogeneity Hypergraph Convolutional Network for Multiple Social RecommendationsabstractSocial relations are often used as auxiliary information to improve recommendations. In the real-world, social relations among users are complex and diverse. However, most existing recommendation methods assume only single social relation (i.e., exploit pairwise relations to mine user preferences), ignoring the impact of multifaceted social relations on user preferences (i.e., high order complexity of user relations). Moreover, an observing fact is that similar items always have similar attractiveness when exposed to users, indicating a potential connection among the static attributes of items. Here, we advocate modeling the dual homogeneity from social relations and item connections by hypergraph convolution networks, named DH-HGCN, to obtain high-order correlations among users and items. Specifically, we use sentiment analysis to extract comment relation and use the k-means clustering to construct item-item correlations, and we then optimize those heterogeneous graphs in a unified framework. Extensive experiments on two real-world datasets demonstrate the effectiveness of our model. Jiadi Han, Yufei Tang, Yuhan Xia |
SIGIR | 1 |