Atteya, Walid Adly, Dahal, Keshav and Hossain, Alamgir (2011) Distributed BitTable Multi-Agent Association Rules Mining Algorithm. In: Knowledge-Based and Intelligent Information and Engineering Systems. Lecture Notes in Computer Science, 6881 . Springer, pp. 151-160. ISBN 978-3-642-23850-5
Full text not available from this repository. (Request a copy)Abstract
Many algorithms have been proposed for the discovery of association rules. The efficiency of these algorithms needs to be improved to handle real-world large datasets. This efficiency can be determined mainly by three factors. The way candidates are generated, the way their supports are counted and the data structure used. Most papers focus on the first and the second factors while few focus on the underlying data structures. In this paper, we present a distributed Multi-Agent based algorithm for mining association rules in distributed environments. The distributed MAS algorithm uses Bit vector data structure that was proved to have better performance in centralized environments. The algorithm is implemented in the context of Multi-Agent systems and complies with global communication standard Foundation for Intelligent Physical Agents (FIPA). The distributed Multi-Agent based algorithm with its new data structure improves implementations reported in the literature that were based on Apriori. The algorithm has better performance over Apriori-like algorithms.
Item Type: | Book Section |
---|---|
Uncontrolled Keywords: | Multi-agent systems, distributed data mining, association rules |
Subjects: | G400 Computer Science G900 Others in Mathematical and Computing Sciences |
Department: | Faculties > Engineering and Environment > Computer and Information Sciences |
Depositing User: | Ay Okpokam |
Date Deposited: | 22 Dec 2011 14:04 |
Last Modified: | 12 Oct 2019 22:26 |
URI: | http://nrl.northumbria.ac.uk/id/eprint/4392 |
Downloads
Downloads per month over past year