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

Haiyue Tang

dblp:393/7685 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2026
0009-0004-4217-1972ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Databases, data management, data science and information retrieval · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › representation learning for recommendation
contrastive learning for recommendation
0.912025
Multi-Behavior Hypergraph Contrastive Learning for Session-Based Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Recommender systems
session-based recommendation
0.912025
Multi-Behavior Hypergraph Contrastive Learning for Session-Based Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Machine learning › Graph learning
hypergraph learning
0.312025
Multi-Behavior Hypergraph Contrastive Learning for Session-Based Recommendation · IEEE Trans. Knowl. Data Eng. 2025

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

self-supervised learning · 1.7hypergraph neural network · 1.7contrastive learning · 1.7
YearPublicationVenuePosition
2026 Next Point of Interest Recommendation Based on Graph Structure and Sequential Pattern
abstract
In location-based social networks, next point of interest (POI) recommendation predicts the next-visited POIs of users by mining their behavioral patterns. However, existing POI recommendation methods based on graph neural networks and attention mechanisms fail to adequately capture: 1) the local structural features influenced by the trajectories of other users (i.e., the relationships between POIs visited by users); and 2) the dynamic visitation preferences and channel relationships among POIs (i.e., interdependencies between contextual features). We propose a next-POI recommendation model based on graph structure and sequential pattern to address these limitations. The model generates graph representations that reflect the real-time preferences of users by extracting local structures from a global POI graph. In addition, we design a temporal-aware self-attentive graph convolutional network and a channel attention mechanism to capture the structural features of users’ sequential visitation tendencies and the latent feature-channel relationships between POIs, respectively. These components enhance the ability of the model to characterize dynamic user preferences and behavioral changes. The results demonstrate that our model outperforms baseline methods on three real-world datasets, validating its effectiveness in capturing both global and local information.
Liangmin Guo, Haiyue Tang, Xiaoyao Zheng, Yonglong Luo
IEEE Trans. Comput. Soc. Syst.3
2025 Multi-Behavior Hypergraph Contrastive Learning for Session-Based Recommendation
abstract
Most current session-based recommendations model session sequences solely based on the user's target behavior, ignoring the user's hidden preferences in auxiliary behaviors. Additionally, they use ordinary graphs to model one-to-one item correlations in the current session and fail to leverage other sessions to learn richer higher-order item correlations. To address these issues, a multi-behavior hypergraph contrastive learning model for session-based recommendations is proposed. This model represents all the sessions as global hypergraphs according to two types of behavior sequences. It employs contrastive learning to obtain global item embeddings, which are further aggregated to generate a global session representation that captures higher-order correlations of items from all session perspectives. A novel local heterogeneous hypergraph is designed for the current session to capture higher-order correlations between items with different behaviors in the current session, thus enhancing the local session representation. Additionally, a novel self-supervised signal is created by constructing a multi-behavior line graph, enhancing the global session representation. Finally, the local session representation, global session representation, and global item embedding are used to learn the predicted interaction probability of each item. Extensive experiments are conducted on three real datasets, and the results demonstrate that the proposed model significantly improves recommendation accuracy.
Liangmin Guo, Shiming Zhou, Haiyue Tang, Xiaoyao Zheng, Yonglong Luo
IEEE Trans. Knowl. Data Eng.3
2024 Knowledge Graph-Based Personalized Multitask Enhanced Recommendation
abstract
To address the problem of data sparsity in recommendation systems, various studies have used knowledge graphs as auxiliary information. These studies have employed multitask learning (MTL) to enhance recommendation performance. However, the shared information between tasks is not fully explored when using an MTL strategy for training both recommendation and knowledge graph-related tasks. Moreover, most studies cannot effectively model the knowledge sharing, consequently affecting recommendation performance. In response to these problems, we proposed a novel knowledge graph-based personalized multitask enhanced recommendation model. To explore the shared information between tasks, a relation attention mechanism was proposed to distinguish the relative importance of neighborhood information to the central entity. Additionally, we utilized a lightweight graph convolutional network to more effectively aggregate high-order neighborhood information from the knowledge graph. This approach improves the accuracy of neighborhood feature and ensures that more suitable shared information is obtained. Furthermore, we developed a linear interaction component to model knowledge sharing between recommendation and knowledge graph embedding tasks. This component allows for detailed feature interaction learning between items and entities, enhancing the shared feature representation, generalization capabilities, and overall performance of the recommendation system. The experimental results on three public datasets indicate that our model outperforms other benchmark models in CTR prediction and top-$\boldsymbol{K}$recommendation.
Liangmin Guo, Shiming Zhou, Haiyue Tang, Xiaoyao Zheng, Yonglong Luo
IEEE Trans. Comput. Soc. Syst.4