Title: P-tree oriented association rule mining of multiple data sources

Authors: R. Subha

Addresses: Department of Computer Science and Engineering, Sri Eshwar College of Engineering, Coimbatore, Tamil Nadu, India

Abstract: A prominent research area in data mining field is (ARM). As distributed databases emerged, need to mine different patterns across them become necessary and hence distributed ARM algorithms were desired. But these algorithms increased communication complexity and overhead. This paper proposes a new algorithm P-tree oriented distributed association rule mining (PDAM) for mining association rules from distributed databases. This algorithm enables a quicker computation of support counts of item sets. P-tree, a special kind of data structure is used in the algorithm which holds the transactional data. These tree data structures do effective storage of data by employing lossless compression techniques. Message exchange optimisation is proposed in this paper. Both the database scans as well as message exchanges are reduced by the proposed method. It would also reduce the size of average transactions, data sets and message exchanges.

Keywords: association rule mining; ARM; P-tree; distributed association rule mining; DARM.

DOI: 10.1504/IJENM.2019.103156

International Journal of Enterprise Network Management, 2019 Vol.10 No.3/4, pp.272 - 279

Received: 17 Oct 2018
Accepted: 24 Mar 2019

Published online: 17 Oct 2019 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article