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

Guoxian Zhou

dblp:398/2516 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0009-0002-8113-0917ORCID · 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 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

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
0.912025
Contrastive Clustering Learning for Multi-Behavior Recommendation · ACM Trans. Inf. Syst. 2025
Recommender systems
graph-based recommendation
0.912025
Contrastive Clustering Learning for Multi-Behavior Recommendation · ACM Trans. Inf. Syst. 2025
Recommender systems › implicit feedback learning
multi-behavior recommendation
0.912025
Contrastive Clustering Learning for Multi-Behavior Recommendation · ACM Trans. Inf. Syst. 2025

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

graph convolutional network · 0.9contrastive learning · 0.9clustering · 0.9
YearPublicationVenuePosition
2025 Contrastive Clustering Learning for Multi-Behavior Recommendation
abstract
Increasing multiple behavior recommendation models have achieved great successes. However, many models do not consider commonalities and differences between behaviors and data sparsity of the target behavior. This article proposes a novel multi-behavior recommendation model based on contrastive clustering learning (MBRCC). Specifically, the graph convolutional network (GCN) is employed to obtain the embeddings of users and items, respectively. Then, three kinds of tasks (including behavior-level embedding, instance-level embedding, and cluster-level embedding) are designed to optimize the embeddings of users and items. In behavior-level embedding, we design an adaptive parameter learning strategy to analyze the impact of auxiliary behaviors on the target behavior. Then, the embeddings of users for each behavior are weighted to obtain the final embeddings of users. In instance-level embedding, we employ contrastive learning to analyze the instances of user and item for mitigating the issue of data sparsity. In cluster-level embedding, we design a new cluster contrastive learning method to capture the similarity between groups of user and item. Finally, we combine these three tasks to improve the quality of the embeddings of users and items. We conduct extensive experiments on three real-world datasets and experimental results indicate that the MBRCC remarkably outperforms numerous existing recommendation models.
Wei Lan 0001, Guoxian Zhou, Qingfeng Chen, Shirui Pan, Yi Pan 0001, Shichao Zhang 0001
ACM Trans. Inf. Syst.2