Reference Hub1
Multilevel Clustering of Induction Rules: Application on Scalable Cognitive Agent

Multilevel Clustering of Induction Rules: Application on Scalable Cognitive Agent

Amine Chemchem, Habiba Drias, Youcef Djenouri
Copyright: © 2014 |Volume: 4 |Issue: 3 |Pages: 25
ISSN: 1947-3052|EISSN: 1947-3060|EISBN13: 9781466656949|DOI: 10.4018/ijssoe.2014070101
Cite Article Cite Article

MLA

Chemchem, Amine, et al. "Multilevel Clustering of Induction Rules: Application on Scalable Cognitive Agent." IJSSOE vol.4, no.3 2014: pp.1-25. http://doi.org/10.4018/ijssoe.2014070101

APA

Chemchem, A., Drias, H., & Djenouri, Y. (2014). Multilevel Clustering of Induction Rules: Application on Scalable Cognitive Agent. International Journal of Systems and Service-Oriented Engineering (IJSSOE), 4(3), 1-25. http://doi.org/10.4018/ijssoe.2014070101

Chicago

Chemchem, Amine, Habiba Drias, and Youcef Djenouri. "Multilevel Clustering of Induction Rules: Application on Scalable Cognitive Agent," International Journal of Systems and Service-Oriented Engineering (IJSSOE) 4, no.3: 1-25. http://doi.org/10.4018/ijssoe.2014070101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The tremendous size of data in nowadays world web invokes many data mining techniques. The recent emergence of some new data mining techniques provide also many interesting induction rules. So, it's important to process these induction rules in order to extract some new strong patterns called meta-rules. This work explores this concept by proposing a new support for induction rules clustering. Besides, a new clustering approach based on multilevel paradigm called multilevel clustering is developed for the purpose of treating large scale knowledge sets. The approach invokes k-means algorithm to cluster induction rules using new designed similarity measures. The developed module have been implemented in the core of the cognitive agent, in order to speed up its reasoning. This new architecture called Multilevel Miner Intelligent Agent (MMIA) is tested on four public benchmarks that contain 25000 rules, and compared to the classical one. As foreseeable, the multilevel clustering outperforms clearly the basic k-means algorithm on both the execution time and success rate criteria.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.