An agent for the HCARD model in the distributed environment

Authors:
Bobby D. Gerardo;Jae-Wan Lee;Jae-jeong Hwang;Jung-Eun Kim
Affiliations:
Kunsan National University, Chonbuk, South Korea;Kunsan National University, Chonbuk, South Korea;Kunsan National University, Chonbuk, South Korea;Kunsan National University, Chonbuk, South Korea
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Year:
2005

Citing 5
Cited 0

Distributed systems (3rd ed.): concepts and design

Distributed systems (3rd ed.): concepts and design
Data mining: concepts and techniques

Data mining: concepts and techniques
NetCube: A Scalable Tool for Fast Data Mining and Compression

Proceedings of the 27th International Conference on Very Large Data Bases
A new two-phase sampling based algorithm for discovering association rules

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering actionable patterns in event data

IBM Systems Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this study, we will employ a multi-agent for searching and extraction of data. We will use Integrator Agent based on CORBA architecture for the proposed model on hierarchical Clustering and Association Rule Discovery (HCARD). The model will address the inadequacy of other data mining tools in processing performance and efficiency when use for knowledge discovery. The result revealed faster searching using the agents. Our experiment also shows that the HCARD generated isolated but imperative association rules which in return could be practically explained for decision making purposes. Shorter processing time had been noted in computing for smaller clusters implying ideal processing period than dealing with the entire dataset.