A gossip based information fusion protocol for distributed frequent itemset mining. Issue 6 (3rd July 2018)

• Record Type: Journal Article
• Authors: Sohrabi, Mohammad Karim
• Is Part Of: Enterprise information systems. Volume 12:Issue 6(2018)
• Page Start: 674
• Page End: 694
• Publication Date: 2018-07-03
• Subjects: Distributed data mining -- frequent itemset mining -- Gossip based protocol -- bit wise approach -- wireless sensor network; Information storage and retrieval systems -- Periodicals; Management information systems -- Periodicals; Electronic commerce -- Periodicals; 658.4038011
• DOI: 10.1080/17517575.2017.1405286
• Languages: English
• ISSNs: 1751-7575

Abstract

ABSTRACT: The computational complexity, huge memory space requirement, and time-consuming nature of frequent pattern mining process are the most important motivations for distribution and parallelization of this mining process. On the other hand, the emergence of distributed computational and operational environments, which causes the production and maintenance of data on different distributed data sources, makes the parallelization and distribution of the knowledge discovery process inevitable. In this paper, a gossip based distributed itemset mining (GDIM) algorithm is proposed to extract frequent itemsets, which are special types of frequent patterns, in a wireless sensor network environment. In this algorithm, local frequent itemsets of each sensor are extracted using a bit-wise horizontal approach (LHPM) from the nodes which are clustered using a leach-based protocol. Heads of clusters exploit a gossip based protocol in order to communicate each other to find the patterns which their global support is equal to or more than the specified support threshold. Experimental results show that the proposed algorithm outperforms the best existing gossip based algorithm in term of execution time.