A MOOC Course Data Analysis Based on an Improved Metapath2vec Algorithm
Many real-world scenarios can be naturally modeled as heterogeneous graphs, which contain both symmetry and asymmetry information. How to learn useful knowledge from the graph has become one of the hot spots of research in artificial intelligence. Based on Metapath2vec algorithm, an improved Metapat...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-05-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/15/6/1178 |
| _version_ | 1797592604147187712 |
|---|---|
| author | Congcong Xu Jing Feng Xiaomin Hu Xiaobin Xu Yi Li Pingzhi Hou |
| author_facet | Congcong Xu Jing Feng Xiaomin Hu Xiaobin Xu Yi Li Pingzhi Hou |
| author_sort | Congcong Xu |
| collection | DOAJ |
| description | Many real-world scenarios can be naturally modeled as heterogeneous graphs, which contain both symmetry and asymmetry information. How to learn useful knowledge from the graph has become one of the hot spots of research in artificial intelligence. Based on Metapath2vec algorithm, an improved Metapath2vec algorithm is presented, which combines Metapath random walk, used to capture semantics and structure information between different nodes of a heterogeneous network, and GloVe model to consider the advantage of global text representation. In order to verify the feasibility and effectiveness of the model, node clustering and link prediction experiments were conducted on the self-generated ideal dataset and the MOOC course data. The analysis of experimental data on these tasks shows that the Metapath–GloVe algorithm learns consistently better embedding of heterogeneous nodes, and the algorithm improves the node embedding performance to better characterize the heterogeneous network structure and learn the characteristics of nodes, which proves the effectiveness and scalability of the proposed method in heterogeneous network mining tasks. It is also shown through extensive experiments that the Metapath–GloVe algorithm is more efficient than the non-negative matrix decomposition algorithm (NMF), and it can obtain better clustering results and more accurate prediction results in the video recommendation task. |
| first_indexed | 2024-03-11T01:53:32Z |
| format | Article |
| id | doaj.art-ddf5a11a84ca492dbef12eac7612e9e3 |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-03-11T01:53:32Z |
| publishDate | 2023-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-ddf5a11a84ca492dbef12eac7612e9e32023-11-18T12:50:33ZengMDPI AGSymmetry2073-89942023-05-01156117810.3390/sym15061178A MOOC Course Data Analysis Based on an Improved Metapath2vec AlgorithmCongcong Xu0Jing Feng1Xiaomin Hu2Xiaobin Xu3Yi Li4Pingzhi Hou5Department of Automation, Hangzhou Dianzi University, Hangzhou 310018, ChinaDepartment of Automation, Hangzhou Dianzi University, Hangzhou 310018, ChinaDepartment of Science, Hangzhou Dianzi University, Hangzhou 310018, ChinaDepartment of Automation, Hangzhou Dianzi University, Hangzhou 310018, ChinaDepartment of Automation, Hangzhou Dianzi University, Hangzhou 310018, ChinaDepartment of Automation, Hangzhou Dianzi University, Hangzhou 310018, ChinaMany real-world scenarios can be naturally modeled as heterogeneous graphs, which contain both symmetry and asymmetry information. How to learn useful knowledge from the graph has become one of the hot spots of research in artificial intelligence. Based on Metapath2vec algorithm, an improved Metapath2vec algorithm is presented, which combines Metapath random walk, used to capture semantics and structure information between different nodes of a heterogeneous network, and GloVe model to consider the advantage of global text representation. In order to verify the feasibility and effectiveness of the model, node clustering and link prediction experiments were conducted on the self-generated ideal dataset and the MOOC course data. The analysis of experimental data on these tasks shows that the Metapath–GloVe algorithm learns consistently better embedding of heterogeneous nodes, and the algorithm improves the node embedding performance to better characterize the heterogeneous network structure and learn the characteristics of nodes, which proves the effectiveness and scalability of the proposed method in heterogeneous network mining tasks. It is also shown through extensive experiments that the Metapath–GloVe algorithm is more efficient than the non-negative matrix decomposition algorithm (NMF), and it can obtain better clustering results and more accurate prediction results in the video recommendation task.https://www.mdpi.com/2073-8994/15/6/1178heterogeneous graph embeddingmeta-pathGloVeclusteringvideo recommendation |
| spellingShingle | Congcong Xu Jing Feng Xiaomin Hu Xiaobin Xu Yi Li Pingzhi Hou A MOOC Course Data Analysis Based on an Improved Metapath2vec Algorithm Symmetry heterogeneous graph embedding meta-path GloVe clustering video recommendation |
| title | A MOOC Course Data Analysis Based on an Improved Metapath2vec Algorithm |
| title_full | A MOOC Course Data Analysis Based on an Improved Metapath2vec Algorithm |
| title_fullStr | A MOOC Course Data Analysis Based on an Improved Metapath2vec Algorithm |
| title_full_unstemmed | A MOOC Course Data Analysis Based on an Improved Metapath2vec Algorithm |
| title_short | A MOOC Course Data Analysis Based on an Improved Metapath2vec Algorithm |
| title_sort | mooc course data analysis based on an improved metapath2vec algorithm |
| topic | heterogeneous graph embedding meta-path GloVe clustering video recommendation |
| url | https://www.mdpi.com/2073-8994/15/6/1178 |
| work_keys_str_mv | AT congcongxu amooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm AT jingfeng amooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm AT xiaominhu amooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm AT xiaobinxu amooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm AT yili amooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm AT pingzhihou amooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm AT congcongxu mooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm AT jingfeng mooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm AT xiaominhu mooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm AT xiaobinxu mooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm AT yili mooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm AT pingzhihou mooccoursedataanalysisbasedonanimprovedmetapath2vecalgorithm |