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

Zuwu Shen

dblp:397/9199 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0006-3455-5292ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2 · 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 · 56% Graph data management · 44%

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

TopicWeightPapersLastEvidence papers
Graph data management
heterogeneous graph
0.912025
MKCRec: Meta-relation guided Knowledge Coupling for Paper Recommendation · ACM Trans. Inf. Syst. 2025
Recommender systems › content recommendation
paper recommendation
0.912025
MKCRec: Meta-relation guided Knowledge Coupling for Paper Recommendation · ACM Trans. Inf. Syst. 2025

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

self-supervised learning · 0.9heterogeneous graph encoder · 0.9cross-meta-path attention · 0.9
YearPublicationVenuePosition
2025 TIDRec: a novel triple-graph interactive distillation method for paper recommendation
Xia Xiao 0002, Yan Liu 0107, Jiaying Huang, Zuwu Shen, Chengde Zhang
Knowl. Inf. Syst.5
2025 MKCRec: Meta-relation guided Knowledge Coupling for Paper Recommendation
abstract
With the surge of academic papers, it has become a common practice to recommend papers based on authors’ research interests. Existing methods focus on leveraging author–paper research interactions to mine authors’ research interests with coauthorship networks. However, sparse research interactions would pose a huge challenge to distinguish research interests of authors. Fortunately, inter-dependent knowledge across papers provides rich potential heterogeneous connections for author–paper interactions, offering much insights for learning authors’ research interests. Therefore, we propose a meta-relation–guided knowledge coupling approach for paper recommendation. Specifically, we construct a meta-relation–guided heterogeneous graph architecture to depict the numerous inter-dependencies among authors and papers, thereby exploring complex author–paper interactions. First, a meta-relation–aware heterogeneous graph encoder is developed to extract relational structure which maintains the relation-specific representation of authors’ research interest and papers’ research relatedness. Then, a cross-meta-path attention network is designed to aggregate the characteristics of different meta-relations and obtain research features of authors and papers. Finally, a self-supervised data augmentation architecture is constructed to mine and preserve local and global graph structure information, acquiring papers with high relevance to author’s research interests through training loss. Numerous experiments are conducted on two real academic datasets, effectively demonstrating the superiority of our proposed model and validating its effectiveness in paper recommendation.
Chengde Zhang, Jiaying Huang, Yan Liu 0107, Xia Xiao 0002, Zuwu Shen
ACM Trans. Inf. Syst.7