P-tree oriented association rule mining of multiple data sources

R. Subha

International Journal of Enterprise Network Management, 2019, vol. 10, issue 3/4, 272-279

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. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=103156 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijenma:v:10:y:2019:i:3/4:p:272-279

Access Statistics for this article

More articles in International Journal of Enterprise Network Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().