Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Haoming Lyu

dblp:345/6266 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-2081-1797ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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%
Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › graph-based recommendation
graph neural network recommendation
0.712023
Enhancing Hierarchy-Aware Graph Networks with Deep Dual Clustering for Session-based Recommendation · WWW 2023
Recommender systems
hyperbolic representation learning
0.712023
Enhancing Hierarchy-Aware Graph Networks with Deep Dual Clustering for Session-based Recommendation · WWW 2023
Recommender systems
session-based recommendation
0.712023
Enhancing Hierarchy-Aware Graph Networks with Deep Dual Clustering for Session-based Recommendation · WWW 2023
Machine learning › Graph learning
graph neural network
0.212023
Enhancing Hierarchy-Aware Graph Networks with Deep Dual Clustering for Session-based Recommendation · WWW 2023

Methods — techniques the papers use, named apart from their topics

hyperbolic geometry · 1.3deep dual clustering · 1.3contrastive learning · 1.3
YearPublicationVenuePosition
2023 Enhancing Hierarchy-Aware Graph Networks with Deep Dual Clustering for Session-based Recommendation
abstract
Session-based Recommendation aims at predicting the next interacted item based on short anonymous behavior sessions. However, existing solutions neglect to model two inherent properties of sequential representing distributions, i.e., hierarchy structures resulted from item popularity and collaborations existing in both intra- and inter-session. Tackling with these two factors at the same time is challenging. On the one hand, traditional Euclidean space utilized in previous studies fails to capture hierarchy structures due to a restricted representation ability. On the other hand, the intuitive apply of hyperbolic geometry could extract hierarchical patterns but more emphasis on degree distribution weakens intra- and inter-session collaborations. To address the challenges, we propose a Hierarchy-Aware Dual Clustering Graph Network (HADCG) model for session-based recommendation. Towards the first challenge, we design the hierarchy-aware graph modeling module which converts sessions into hyperbolic session graphs, adopting hyperbolic geometry in propagation and attention mechanism so as to integrate chronological and hierarchical information. As for the second challenge, we introduce the deep dual clustering module which develops a two-level clustering strategy, i.e., information regularizer for intra-session clustering and contrastive learner for inter-session clustering, to enhance hyperbolic representation learning from collaborative perspectives and further promote recommendation performance. Extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed HADCG.
Jiajie Su, Chaochao Chen 0001, Weiming Liu 0005, Fei Wu 0001, Haoming Lyu
WWW6