Ming Li;Zhao Li;Changqin Huang;Yunliang Jiang;Xindong Wu
{"title":"EduGraph:用于 MOOC 课程推荐的基于学习路径的超图神经网络","authors":"Ming Li;Zhao Li;Changqin Huang;Yunliang Jiang;Xindong Wu","doi":"10.1109/TBDATA.2024.3453757","DOIUrl":null,"url":null,"abstract":"In online learning, personalized course recommendations that align with learners’ preferences and future needs are essential. Thus, the development of efficient recommender systems is crucial to guide learners to appropriate courses. Graph learning in recommender systems has been extensively studied, yet many models focus on low-frequency information, underscoring similar learner preferences and overlooking high-frequency data that indicates varied learning trajectories. Furthermore, course co-occurrence and sequential relationships are often insufficiently investigated. In this paper, we introduce \n<monospace><b>EduGraph</b></monospace>\n, a novel framework developed specifically for MOOC course recommendation systems. \n<monospace><b>EduGraph</b></monospace>\n is characterized by its incorporation of a learning path-based hypergraph, a unique perspective wherein learners are represented as hyperedges, and courses are delineated as vertices. The framework incorporates a framelet-based hypergraph convolution, integrating low-pass filters to highlight similarities and high-pass filters to underscore distinct learning paths among learners. Furthermore, \n<monospace><b>EduGraph</b></monospace>\n features a dual hypergraph learning model, with channels designated for vertex and hyperedge encoding, fostering a collaborative information exchange that refines the learners’ preference embeddings. The empirical assessment of \n<monospace><b>EduGraph</b></monospace>\n is conducted through a comprehensive comparison with many existing baselines, utilizing two distinct MOOC datasets. Our experimental studies not only emphasize the enhanced recommendation performance of \n<monospace><b>EduGraph</b></monospace>\n but also elucidate the significant contributions of its individual components, such as the integration of low-pass and high-pass filters and the framelet-wise collaborative strategy that effectively bridges hyperedge-level and vertex-level representations, augmenting the overall efficacy of the course recommendation system.","PeriodicalId":13106,"journal":{"name":"IEEE Transactions on Big Data","volume":"10 6","pages":"706-719"},"PeriodicalIF":7.5000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"EduGraph: Learning Path-Based Hypergraph Neural Networks for MOOC Course Recommendation\",\"authors\":\"Ming Li;Zhao Li;Changqin Huang;Yunliang Jiang;Xindong Wu\",\"doi\":\"10.1109/TBDATA.2024.3453757\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In online learning, personalized course recommendations that align with learners’ preferences and future needs are essential. Thus, the development of efficient recommender systems is crucial to guide learners to appropriate courses. Graph learning in recommender systems has been extensively studied, yet many models focus on low-frequency information, underscoring similar learner preferences and overlooking high-frequency data that indicates varied learning trajectories. Furthermore, course co-occurrence and sequential relationships are often insufficiently investigated. In this paper, we introduce \\n<monospace><b>EduGraph</b></monospace>\\n, a novel framework developed specifically for MOOC course recommendation systems. \\n<monospace><b>EduGraph</b></monospace>\\n is characterized by its incorporation of a learning path-based hypergraph, a unique perspective wherein learners are represented as hyperedges, and courses are delineated as vertices. The framework incorporates a framelet-based hypergraph convolution, integrating low-pass filters to highlight similarities and high-pass filters to underscore distinct learning paths among learners. Furthermore, \\n<monospace><b>EduGraph</b></monospace>\\n features a dual hypergraph learning model, with channels designated for vertex and hyperedge encoding, fostering a collaborative information exchange that refines the learners’ preference embeddings. The empirical assessment of \\n<monospace><b>EduGraph</b></monospace>\\n is conducted through a comprehensive comparison with many existing baselines, utilizing two distinct MOOC datasets. Our experimental studies not only emphasize the enhanced recommendation performance of \\n<monospace><b>EduGraph</b></monospace>\\n but also elucidate the significant contributions of its individual components, such as the integration of low-pass and high-pass filters and the framelet-wise collaborative strategy that effectively bridges hyperedge-level and vertex-level representations, augmenting the overall efficacy of the course recommendation system.\",\"PeriodicalId\":13106,\"journal\":{\"name\":\"IEEE Transactions on Big Data\",\"volume\":\"10 6\",\"pages\":\"706-719\"},\"PeriodicalIF\":7.5000,\"publicationDate\":\"2024-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Big Data\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10663938/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Big Data","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10663938/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
EduGraph: Learning Path-Based Hypergraph Neural Networks for MOOC Course Recommendation
In online learning, personalized course recommendations that align with learners’ preferences and future needs are essential. Thus, the development of efficient recommender systems is crucial to guide learners to appropriate courses. Graph learning in recommender systems has been extensively studied, yet many models focus on low-frequency information, underscoring similar learner preferences and overlooking high-frequency data that indicates varied learning trajectories. Furthermore, course co-occurrence and sequential relationships are often insufficiently investigated. In this paper, we introduce
EduGraph
, a novel framework developed specifically for MOOC course recommendation systems.
EduGraph
is characterized by its incorporation of a learning path-based hypergraph, a unique perspective wherein learners are represented as hyperedges, and courses are delineated as vertices. The framework incorporates a framelet-based hypergraph convolution, integrating low-pass filters to highlight similarities and high-pass filters to underscore distinct learning paths among learners. Furthermore,
EduGraph
features a dual hypergraph learning model, with channels designated for vertex and hyperedge encoding, fostering a collaborative information exchange that refines the learners’ preference embeddings. The empirical assessment of
EduGraph
is conducted through a comprehensive comparison with many existing baselines, utilizing two distinct MOOC datasets. Our experimental studies not only emphasize the enhanced recommendation performance of
EduGraph
but also elucidate the significant contributions of its individual components, such as the integration of low-pass and high-pass filters and the framelet-wise collaborative strategy that effectively bridges hyperedge-level and vertex-level representations, augmenting the overall efficacy of the course recommendation system.
期刊介绍:
The IEEE Transactions on Big Data publishes peer-reviewed articles focusing on big data. These articles present innovative research ideas and application results across disciplines, including novel theories, algorithms, and applications. Research areas cover a wide range, such as big data analytics, visualization, curation, management, semantics, infrastructure, standards, performance analysis, intelligence extraction, scientific discovery, security, privacy, and legal issues specific to big data. The journal also prioritizes applications of big data in fields generating massive datasets.