Skip to main content

A Dynamic Self-Organizing E-Learner Communities with Improved Multi-agent Matchmaking Algorithm

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2903))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Singh, N.: A Common Lisp API and Facilitator for ABSI: Version 2.0.3, Technical Report Logic-93-4, Logic Group, Computer Science Department, Stanford University (1993)

    Google Scholar 

  2. Sycara, K., Lu, J., Klusch, M., Wido, S.: Matchmaking Among Heterogeneous Agents on the Internet. In: Proceedings of AAAI Spring Symposium on Intelligent Agents in Cyberspace, Stanford, USA (1999), http://www.cs.cmu.edu/~softagents/publications.html

  3. Subrahmanian, V., Bonatti, P., Dix, J., et al.: Heterogeneous Agent Systems. The MIT Press, Cambridge (2000)

    Google Scholar 

  4. Klusch, M., Sycara, K.: Brokering and Matchmaking for Coordination of Agent Societies: A Survey. In: Omicini, A., Zambonelli, F., Klusch, M., Tolksdorf, R. (eds.) Coordination of Internet Agents: Models, Technologies and Applications, Ch. 8. Springer, Heidelberg (2001)

    Google Scholar 

  5. Wang, F.: Self-organising communities formed by middle agents. In: Proceedings of the First International Conference on Autonomous Agents and Multi-Agent Systems, Bologna, Italy, July 2002, pp. 1333–1339 (2002)

    Google Scholar 

  6. Turner, P.J., Jennings, N.R.: Improving the scalability of multi-agent systems. In: Proceedings of the First International Workshop on Infrastructure for Scalable Multi-Agent Systems, pp. 246–262 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shen, R., Yang, F., Han, P. (2003). A Dynamic Self-Organizing E-Learner Communities with Improved Multi-agent Matchmaking Algorithm. In: Gedeon, T.(.D., Fung, L.C.C. (eds) AI 2003: Advances in Artificial Intelligence. AI 2003. Lecture Notes in Computer Science(), vol 2903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24581-0_50

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24581-0_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20646-0

  • Online ISBN: 978-3-540-24581-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics