The EMADS Extendible Multi-Agent Data Mining Framework | SpringerLink
Skip to main content

The EMADS Extendible Multi-Agent Data Mining Framework

  • Chapter
Data Mining and Multi-agent Integration

Abstract

In this chapter we describe EMADS, an Extendible Multi-Agent Data mining System. The EMADS vision is that of a community of data mining agents, contributed by many individuals and interacting under decentralized control, to address data mining requests. EMADS is seen both as an end user platform and a research tool. This chapter details the EMADS vision, the associated conceptual framework and the current implementation. Although EMADS may be applied to many data mining tasks; the study described here, for the sake of brevity, concentrates on agent based Association Rule Mining and agent based classification. A full description of EMADS is presented.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 17159
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 21449
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
JPY 21449
Price includes VAT (Japan)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aggarwal, C. and Yu, P., “A Condensation Approach to Privacy Preserving DataMining”. Lecture Notes in Computer Science, Vol. 2992, pp. 183–199, (2004).

    Article  Google Scholar 

  2. Albashiri, K., Coenen, F., Sanderson, R. and Len, P., “Frequent Set Meta Mining: Towards Multi-Agent Data Mining”. InBramer, M., Coenen, F. P., and Petridis, M.(Eds.), Research and Development, Springer, London, pp 139–151, (2007).

    Google Scholar 

  3. Albashiri, K., Coenen, F., and Leng, P., “Agent Based Frequent Set Meta Mining: Introducing EMADS”. AI in Theory and Practice II, Proceedings IFIP, Springer, pp23–32, (2007).

    Google Scholar 

  4. Baazaoui H., Faiz S., Hamed R., and Ghezala H., “A Framework for data mining based multiagent: an application to spatial data”. 3rd World Enformatika Conference, Istanbul, (2005).

    Google Scholar 

  5. Bellifemine, F. Poggi, A. and Rimassi, G., “JADE: A FIPA-Compliant agent framework”. Proceedings Practical Applications of Intelligent Agents and Multi-Agents, pg 97–108, (1999). (See http://sharon.cselt.it/projects/jade for latest information).

  6. Blake, C. and Merz, C. “UCI Repository of machine learning databases”. (1998). Irvine, CA: University of California, Department of Information and Computer Science. http://www.ics.uci.edu/mlearn/MLRepository.html

  7. Bose, R. and V. Sugumaran, “IDM: An Intelligent Software Agent Based Data Mining Environment”. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2888–2893 San Diego, CA: IEEE Press, (1998).

    Google Scholar 

  8. Coenen, F., Leng, P., and Goulbourne, G., “Tree Structures for Mining Association Rules”. Journal of Data Mining and Knowledge Discovery, Vol 8, No 1, pp25–51, (2004).

    Article  MathSciNet  Google Scholar 

  9. Coenen, F., Leng, P. and Zhang, L. “Threshold Tuning for Improved Classification Association Rule Mining”. Proceeding PAKDD, LNAI3158, Springer, pp216–225, (2005).

    Google Scholar 

  10. Foundation for Intelligent Physical Agents, FIPA 2002 Specification. Geneva, Switzerland. (See http://www.fipa.org/specifications/index.html).

  11. Giuseppe, D., Giancarlo, F., “A customizable multi-agent system for distributed data mining”. Proceedings of the 2007 ACM symposium on applied computing, Pages: 42 47, (2007).

    Google Scholar 

  12. Kamber, M., Winstone, L., Wan, G., Shan, S. and Jiawei, H., “Generalization and Decision Tree Induction: Efficient Classification in Data Mining”. Proceedings of the Seventh International Workshop on Research Issues in Data Engineering, pp. 111–120, (1997).

    Google Scholar 

  13. Li W., Han, J. and Pei, J., “CMAR: Accurate and Efficient Classification Based on Multiple Class-Association Rules”. Proceedings ICDM, pp369–376, (2001).

    Google Scholar 

  14. Liu, B. Hsu, W. and Ma, Y., “Integrating Classification and Assocoiation Rule Mining”. Proceedings KDD-98, New York, 27–31 August. AAAI. pp80–86, (1998).

    Google Scholar 

  15. Quinlan, J. R. and Cameron-Jones, R. M., “FOIL: A Midterm Report”. Proceedings ECML, Vienna, Austria, pp3–20. (1993).

    Google Scholar 

  16. Yin, X. and Han, J., “PAR: Classification based on Predictive Association Rules”. Proceedings SIAM Int. Conf. on Data Mining (SDM’03), San Fransisco, CA, pp. 331–335, (2003).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kamal Ali Albashiri .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Albashiri, K.A., Coenen, F. (2009). The EMADS Extendible Multi-Agent Data Mining Framework. In: Cao, L. (eds) Data Mining and Multi-agent Integration. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-0522-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-0522-2_13

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-0521-5

  • Online ISBN: 978-1-4419-0522-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics