A dynamic self-organizing e-learner communities with improved multi-agent matchmaking algorithm

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Learning experiences and resources sharing is becoming one of the most important research fields of the advanced E-Learning techniques. This paper proposed a dynamic self-organizing community mechanism with an improved matchmaking algorithm, which makes the systems having the ability of self-organizing community that groups similar agents according to their preferences and capabilities. How to represent, evaluation, exchange as well as how to matchmaking during the self-organizing process are discussed in the algorithms. A prototype is also built to verify the algorithms. Experiments based on rea learner data have shown that this mechanism can organize learners properly, and has sustainably improved speed and efficiency of searches for peer students owning relevant knowledge resources.

Author supplied keywords

Cite

CITATION STYLE

APA

Shen, R., Yang, F., & Han, P. (2003). A dynamic self-organizing e-learner communities with improved multi-agent matchmaking algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2903, pp. 590–600). Springer Verlag. https://doi.org/10.1007/978-3-540-24581-0_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free