dewan-anefficientalgorithm-2013.pdf (236.65 kB)
An efficient algorithm for partitioning and authenticating problem-solutions of elearning contents
journal contribution
posted on 2013-01-01, 00:00 authored by Jahangir Dewan, Morshed ChowdhuryMorshed Chowdhury, Lynn BattenLynn BattenContent 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.
History
Journal
E-Learning and digital mediaVolume
10Issue
3Pagination
236 - 241Publisher
Symposium JournalsLocation
Oxford, EnglandPublisher DOI
ISSN
2042-7530Language
engPublication classification
C1 Refereed article in a scholarly journalCopyright notice
2013, Symposium JournalsUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC