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

Zhu Su

dblp:192/1271 · DBLP profile ↗
← Back
7ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · conflict

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

Human-computer interaction and ubiquitous computing · 3Applied, interdisciplinary, general and emerging computing · 3Artificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 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 · 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 Ecological network analysis of attention flow in online learning: Insights into knowledge acquisition and dropout behaviors
Zhu Su, Zhongyu Shao, Sannyuya Liu
Inf. Process. Manag.1
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.1
2024 Emotion-Semantic-Aware Dual Contrastive Learning for Epistemic Emotion Identification of Learner-Generated Reviews in MOOCs
abstract
Identifying the epistemic emotions of learner-generated reviews in massive open online courses (MOOCs) can help instructors provide adaptive guidance and interventions for learners. The epistemic emotion identification task is a fine-grained identification task that contains multiple categories of emotions arising during the learning process. Previous studies only consider emotional or semantic information within the review texts alone, which leads to insufficient feature representation. In addition, some categories of epistemic emotions are ambiguously distributed in feature space, making them hard to be distinguished. In this article, we present an emotion-semantic-aware dual contrastive learning (ES-DCL) approach to tackle these issues. In order to learn sufficient feature representation, implicit semantic features and human-interpretable emotional features are, respectively, extracted from two different views to form complementary emotional-semantic features. On this basis, by leveraging the experience of domain experts and the input emotional-semantic features, two types of contrastive losses (label contrastive loss and feature contrastive loss) are formulated. They are designed to train the discriminative distribution of emotional-semantic features in the sample space and to solve the anisotropy problem between different categories of epistemic emotions. The proposed ES-DCL is compared with 11 other baseline models on four different disciplinary MOOCs review datasets. Extensive experimental results show that our approach improves the performance of epistemic emotion identification, and significantly outperforms state-of-the-art deep learning-based methods in learning more discriminative sentence representations.
Zhi Liu 0011, Chaodong Wen, Zhu Su, Sannyuya Liu, Weizheng Kong, Zongkai Yang
IEEE Trans. Neural Networks Learn. Syst.3
2020 Investigating the Differences of Student Interactions between Behavior- and Content-based Networks in Online Discussions
Tianhui Hu, Huanyou Chai, Sannyuya Liu, Guanxian Yi, Zhi Liu 0011, Zhu Su
CSEDU (2)7
2020 Investigating the Relationship between Learners' Cognitive Participation and Learning Outcome in Asynchronous Online Discussion Forums
Zhi Liu 0011, Shiqi Liu 0003, Cuishuang Zhang, Zhu Su, Tianhui Hu, Sannyuya Liu
CSEDU (2)4
2020 Investigating the Relationship among Students' Interest, Flow and Their Learning Outcomes in a Blended Learning Asynchronous Forum
Shanyu Tan, Zhi Liu 0011, Shiqi Liu 0003, Zhu Su, Huanyou Chai, Sannyuya Liu
CSEDU (2)4
2020 Evolution features and behavior characters of friendship networks on campus life
Zongkai Yang, Zhu Su, Sannyuya Liu, Zhi Liu 0011, Wenxiang Ke, Liang Zhao 0016
Expert Syst. Appl.2