Distributed BitTable Multi-Agent Association Rules Mining Algorithm

Walid Adly Atteya, Keshav Dahal, M. Alamgir Hossain

Research output: Chapter in Book/Report/Conference proceedingChapter

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.
Original languageEnglish
Title of host publicationKnowledge-based and Intelligent Information and Engineering Systems, Pt 1
PublisherSpringer-Verlag
Pages151-160
Volume6881
ISBN (Print)978-3-642-23850-5
DOIs
Publication statusPublished - 2011
Externally publishedYes

Publication series

NameLecture Notes in Computer Science

Keywords

  • Multi-Agent Systems
  • Distributed Data Mining
  • Association Rules

Cite this

Atteya, W. A., Dahal, K., & Hossain, M. A. (2011). Distributed BitTable Multi-Agent Association Rules Mining Algorithm. In Knowledge-based and Intelligent Information and Engineering Systems, Pt 1 (Vol. 6881, pp. 151-160). (Lecture Notes in Computer Science). Springer-Verlag. https://doi.org/10.1007/978-3-642-23851-2_16
Atteya, Walid Adly ; Dahal, Keshav ; Hossain, M. Alamgir. / Distributed BitTable Multi-Agent Association Rules Mining Algorithm. Knowledge-based and Intelligent Information and Engineering Systems, Pt 1. Vol. 6881 Springer-Verlag, 2011. pp. 151-160 (Lecture Notes in Computer Science).
@inbook{af4b608debde458c96b325207a4b06b5,
title = "Distributed BitTable Multi-Agent Association Rules Mining Algorithm",
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.",
keywords = "Multi-Agent Systems, Distributed Data Mining, Association Rules",
author = "Atteya, {Walid Adly} and Keshav Dahal and Hossain, {M. Alamgir}",
year = "2011",
doi = "10.1007/978-3-642-23851-2_16",
language = "English",
isbn = "978-3-642-23850-5",
volume = "6881",
series = "Lecture Notes in Computer Science",
publisher = "Springer-Verlag",
pages = "151--160",
booktitle = "Knowledge-based and Intelligent Information and Engineering Systems, Pt 1",
address = "Germany",

}

Atteya, WA, Dahal, K & Hossain, MA 2011, Distributed BitTable Multi-Agent Association Rules Mining Algorithm. in Knowledge-based and Intelligent Information and Engineering Systems, Pt 1. vol. 6881, Lecture Notes in Computer Science, Springer-Verlag, pp. 151-160. https://doi.org/10.1007/978-3-642-23851-2_16

Distributed BitTable Multi-Agent Association Rules Mining Algorithm. / Atteya, Walid Adly; Dahal, Keshav; Hossain, M. Alamgir.

Knowledge-based and Intelligent Information and Engineering Systems, Pt 1. Vol. 6881 Springer-Verlag, 2011. p. 151-160 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Distributed BitTable Multi-Agent Association Rules Mining Algorithm

AU - Atteya, Walid Adly

AU - Dahal, Keshav

AU - Hossain, M. Alamgir

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Multi-Agent Systems

KW - Distributed Data Mining

KW - Association Rules

U2 - 10.1007/978-3-642-23851-2_16

DO - 10.1007/978-3-642-23851-2_16

M3 - Chapter

SN - 978-3-642-23850-5

VL - 6881

T3 - Lecture Notes in Computer Science

SP - 151

EP - 160

BT - Knowledge-based and Intelligent Information and Engineering Systems, Pt 1

PB - Springer-Verlag

ER -

Atteya WA, Dahal K, Hossain MA. Distributed BitTable Multi-Agent Association Rules Mining Algorithm. In Knowledge-based and Intelligent Information and Engineering Systems, Pt 1. Vol. 6881. Springer-Verlag. 2011. p. 151-160. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-642-23851-2_16