NotesFAQContact Us
Collection
Advanced
Search Tips
Peer reviewed Peer reviewed
Direct linkDirect link
ERIC Number: EJ1018657
Record Type: Journal
Publication Date: 2013
Pages: 6
Abstractor: As Provided
Reference Count: 6
ISBN: N/A
ISSN: ISSN-2042-7530
An Efficient Algorithm for Partitioning and Authenticating Problem-Solutions of eLeaming Contents
Dewan, Jahangir; Chowdhury, Morshed; Batten, Lynn
E-Learning and Digital Media, v10 n3 p236-241 2013
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.
Symposium Journals. P.O. Box 204, Didcot, Oxford, OX11 9ZQ, UK. Tel: +44-1235-818-062; Fax: +44-1235-817-275; e-mail: subscriptions@symposium-journals.co.uk; Web site: http://www.wwwords.co.uk/elea
Publication Type: Journal Articles; Reports - Descriptive
Education Level: N/A
Audience: N/A
Language: English
Sponsor: N/A
Authoring Institution: N/A