A Novel Search Ranking Method for MOOCs Using Unstructured Course Information
Massive open online courses (MOOCs) are a technical trend in the field of education. As the number of available MOOCs continues to grow dramatically, the difficulty for learners to find courses that satisfy their personalized learning goals has also increased. Unstructured texts, such as course desc...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-Wiley
2020-01-01
|
Series: | Wireless Communications and Mobile Computing |
Online Access: | http://dx.doi.org/10.1155/2020/8813615 |
id |
doaj-afac29d241014749ac9341e2674746f5 |
---|---|
record_format |
Article |
spelling |
doaj-afac29d241014749ac9341e2674746f52020-11-25T03:40:32ZengHindawi-WileyWireless Communications and Mobile Computing1530-86691530-86772020-01-01202010.1155/2020/88136158813615A Novel Search Ranking Method for MOOCs Using Unstructured Course InformationWeiqiang Yao0Haiquan Sun1Xiaoxuan Hu2School of Management, Hefei University of Technology, Hefei, Anhui 230009, ChinaSchool of Management, Hefei University of Technology, Hefei, Anhui 230009, ChinaSchool of Management, Hefei University of Technology, Hefei, Anhui 230009, ChinaMassive open online courses (MOOCs) are a technical trend in the field of education. As the number of available MOOCs continues to grow dramatically, the difficulty for learners to find courses that satisfy their personalized learning goals has also increased. Unstructured texts, such as course descriptions and course skills, contain rich course information and are useful for MOOC platforms in constructing personalized services. This paper proposes a novel search ranking method for MOOCs that integrates unstructured course information. We propose a latent Dirichlet allocation-based model to cluster courses into groups based on course descriptions. Courses in the same cluster are considered to share similar educational contents. We then propose the CourseRank algorithm based on the information of course skills to recommend and rank courses when students search for or click on a specific course. Our experiments on the dataset from Coursera indicate that our method is able to cluster courses effectively and produce satisfactory ranking results for courses in MOOC platforms.http://dx.doi.org/10.1155/2020/8813615 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Weiqiang Yao Haiquan Sun Xiaoxuan Hu |
spellingShingle |
Weiqiang Yao Haiquan Sun Xiaoxuan Hu A Novel Search Ranking Method for MOOCs Using Unstructured Course Information Wireless Communications and Mobile Computing |
author_facet |
Weiqiang Yao Haiquan Sun Xiaoxuan Hu |
author_sort |
Weiqiang Yao |
title |
A Novel Search Ranking Method for MOOCs Using Unstructured Course Information |
title_short |
A Novel Search Ranking Method for MOOCs Using Unstructured Course Information |
title_full |
A Novel Search Ranking Method for MOOCs Using Unstructured Course Information |
title_fullStr |
A Novel Search Ranking Method for MOOCs Using Unstructured Course Information |
title_full_unstemmed |
A Novel Search Ranking Method for MOOCs Using Unstructured Course Information |
title_sort |
novel search ranking method for moocs using unstructured course information |
publisher |
Hindawi-Wiley |
series |
Wireless Communications and Mobile Computing |
issn |
1530-8669 1530-8677 |
publishDate |
2020-01-01 |
description |
Massive open online courses (MOOCs) are a technical trend in the field of education. As the number of available MOOCs continues to grow dramatically, the difficulty for learners to find courses that satisfy their personalized learning goals has also increased. Unstructured texts, such as course descriptions and course skills, contain rich course information and are useful for MOOC platforms in constructing personalized services. This paper proposes a novel search ranking method for MOOCs that integrates unstructured course information. We propose a latent Dirichlet allocation-based model to cluster courses into groups based on course descriptions. Courses in the same cluster are considered to share similar educational contents. We then propose the CourseRank algorithm based on the information of course skills to recommend and rank courses when students search for or click on a specific course. Our experiments on the dataset from Coursera indicate that our method is able to cluster courses effectively and produce satisfactory ranking results for courses in MOOC platforms. |
url |
http://dx.doi.org/10.1155/2020/8813615 |
work_keys_str_mv |
AT weiqiangyao anovelsearchrankingmethodformoocsusingunstructuredcourseinformation AT haiquansun anovelsearchrankingmethodformoocsusingunstructuredcourseinformation AT xiaoxuanhu anovelsearchrankingmethodformoocsusingunstructuredcourseinformation AT weiqiangyao novelsearchrankingmethodformoocsusingunstructuredcourseinformation AT haiquansun novelsearchrankingmethodformoocsusingunstructuredcourseinformation AT xiaoxuanhu novelsearchrankingmethodformoocsusingunstructuredcourseinformation |
_version_ |
1715149299039338496 |