You are here:

An Efficient Algorithm for Partitioning and Authenticating Problem-Solutions of eLeaming Contents
ARTICLE

, ,

E-Learning and Digital Media Volume 10, Number 3, ISSN 2042-7530

Abstract

Content authenticity and correctness is one of the important challenges in eLearning as there can be many solutions to one specific problem in cyber space. Therefore, the authors feel it is necessary to map problems to solutions using graph partition and weighted bipartite matching. This article proposes an efficient algorithm to partition question-answer (QA) space and explores the best possible solution to a particular problem. The approach described can be efficiently applied to social eLearning space where there are one-to-many and many-to-many relationships with a level of bonding. The main advantage of this approach is that it uses QA ranking by adjusted edge weights provided by subject-matter experts or the authors' expert database.

Citation

Dewan, J., Chowdhury, M. & Batten, L. (2013). An Efficient Algorithm for Partitioning and Authenticating Problem-Solutions of eLeaming Contents. E-Learning and Digital Media, 10(3), 236-241. Retrieved April 8, 2020 from .

This record was imported from ERIC on November 3, 2015. [Original Record]

ERIC is sponsored by the Institute of Education Sciences (IES) of the U.S. Department of Education.

Copyright for this record is held by the content creator. For more details see ERIC's copyright policy.

Keywords