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.

Longfeng Zhao

dblp:192/1984 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
0000-0002-0642-3798ORCID · 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%
Artificial intelligence
1 paper
Graph learning · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
0.912025
Hypergraph Convolutional Networks for Course Recommendation in MOOCs · IEEE Trans. Knowl. Data Eng. 2025
Recommender systems › domain-specific recommendation
course recommendation
0.912025
Hypergraph Convolutional Networks for Course Recommendation in MOOCs · IEEE Trans. Knowl. Data Eng. 2025
Recommender systems
graph-based recommendation
0.912025
Hypergraph Convolutional Networks for Course Recommendation in MOOCs · IEEE Trans. Knowl. Data Eng. 2025
Recommender systems
hypergraph convolutional network
0.912025
Hypergraph Convolutional Networks for Course Recommendation in MOOCs · IEEE Trans. Knowl. Data Eng. 2025
Machine learning › Graph learning › hypergraph learning
hypergraph convolution
0.312025
Hypergraph Convolutional Networks for Course Recommendation in MOOCs · IEEE Trans. Knowl. Data Eng. 2025
Machine learning › Graph learning
hypergraph learning
0.312025
Hypergraph Convolutional Networks for Course Recommendation in MOOCs · IEEE Trans. Knowl. Data Eng. 2025

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

hypergraph convolution · 1.7graph convolutional network · 1.7contrastive learning · 1.7
YearPublicationVenuePosition
2025 Hypergraph Convolutional Networks for Course Recommendation in MOOCs
abstract
Mining learner preferences and needs from individual learning behavior data is a critical task in course recommendation systems. While graph-based models have shown efficacy in capturing pairwise relationships between learners and courses, they often overlook the complex higher-order interactions involving learners, courses and teachers that are essential for accurate recommendations. To address this limitation, we propose a novel Hypergraph Convolutional Network for Course Recommendation (HCNCR) framework, designed to model these higher-order interactions effectively. Our approach constructs course and learner hypergraphs based on course attributes and learner similarity relations, respectively. By employing hypergraph convolution, we capture the intrinsic higher-order relationships within these hypergraphs. Additionally, we utilize graph convolutional layers on the learner-course bipartite graph to integrate embeddings derived from hypergraphs, achieving comprehensive representations of both learners and courses. Extensive experiments conducted on real-world datasets demonstrate that HCNCR significantly outperforms existing state-of-the-art methods in course recommendation tasks.
Zhu Su, Qing Li 0045, Zhonghua Yan, Longfeng Zhao, Zhi Liu 0011, Sannyuya Liu
IEEE Trans. Knowl. Data Eng.5