Towards an adaptive multi-agent architecture for association rule mining in distributed databases

Association rule mining, which is a data mining technique, finds interesting association or correlation relationships among a large set of data items. Current association rule mining tasks can only be accomplished successfully only in a distributed setting, which will require integration of knowledge generated from the multiple data sites. Most existing architectures for mining in such circumstances require massive movement of data resulting in high communication overheads leading to slow response time. These challenges are heightened when we have extremely large data sizes in multiple heterogeneous sites. Moreover, most existing algorithms and architectures are only moderately suitable for real-world scenarios. There is therefore an urgent need for improved architectures that will explore the capabilities of software agents' paradigms in order to improve on the existing systems. This work therefore introduces an adaptive architectural framework that mines association rules across multiple data sites, and more importantly the architecture adapts to changes in the updated database giving special considerations to the incremental database with the X-Apriori algorithm. The results integration agent also adapts to changes in the results sites considering the data size; size of the agents; size of intermediate results; bandwidth, and other computational resources at the data servers. The proposed system promises to reduce communication and interpretation costs, improve autonomy and efficiency of distributed association rule mining tasks.

[1]  Y. Shoham Introduction to Multi-Agent Systems , 2002 .

[2]  Geoffrey I. Webb Efficient search for association rules , 2000, KDD '00.

[3]  Teck-How Chia,et al.  Strategically Mobile Agents , 1997, Mobile Agents.

[4]  George Cybenko,et al.  Mobile Agents: Motivations and State-of-the-Art Systems , 2000 .

[5]  Michael Byrd,et al.  The State of Distributed Data Mining [ ECS 265 Project Report ] , 2006 .

[6]  Sujni Paul,et al.  An Optimized Distributed Association Rule Mining Algorithm in Parallel and Distributed Data Mining with XML Data for Improved Response Time , 2010 .

[7]  Kamal Ali Albashiri An investigation into the issues of multi-agent data mining , 2010 .

[8]  LehnerWolfgang,et al.  Robust and distributed top-n frequent-pattern mining with SAP BW accelerator , 2009, VLDB 2009.

[9]  Ezendu Ifeanyi Ariwa,et al.  Informatization and E-Business Model Application for Distributed Data Mining Using Mobile Agents , 2003, ICWI.

[10]  Dimitris Kanellopoulos,et al.  Association Rules Mining: A Recent Overview , 2006 .

[11]  Ilker Hamzaoglu,et al.  Scalable, Distributed Data Mining - An Agent Architecture , 1997, KDD.

[12]  David Taniar,et al.  ODAM: An optimized distributed association rule mining algorithm , 2004, IEEE Distributed Systems Online.

[13]  Das Amrita,et al.  Mining Association Rules between Sets of Items in Large Databases , 2013 .

[14]  Adewale Opeoluwa Ogunde,et al.  A Review of Some Issues and Challenges in Current Agent-Based Distributed Association Rule Mining , 2011 .

[15]  Frans Coenen,et al.  EMADS: An Extendible Multi-Agent Data Miner , 2008, SGAI Conf..

[16]  Ulrich Güntzer,et al.  Algorithms for association rule mining — a general survey and comparison , 2000, SKDD.

[17]  Jian Pei,et al.  Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[18]  Philip S. Yu,et al.  Data Mining: An Overview from a Database Perspective , 1996, IEEE Trans. Knowl. Data Eng..