Ananthanarayana, VS and Subramanian, DK and Murty, Narasimha M (2000) Scalable, Distributed and Dynamic Mining of Association Rules. In: 7th International Conference of High Performance Computing - HiPC 2000, December 2000, Bangalore, India, pp. 559-566.
![]() |
PDF
Scalable.pdf - Published Version Restricted to Registered users only Download (558kB) | Request a copy |
Abstract
We propose a novel pattern tree called Pattern Count tree (PC- tree) which is a complete and compact representation of the database. We show that construction of this tree and then generation of all large itemsets requires a single database scan where as the current algorithms need at least two database scans. The completeness property of the PC-tree with respect to the database makes it amenable for mining association rules in the context of changing data and knowledge, which we call dynamic mining. Algorithms based on PC-tree are scalable because PC-tree is compact. We propose a partitioned distributed architecture and an efficient distributed association rule mining algorithm based on the PC-tree structure.
Item Type: | Conference Paper |
---|---|
Publication: | High Performance Computing Hipc 2000, Proceedings |
Publisher: | Springer |
Additional Information: | The copyright of this article belongs to Springer. |
Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
Date Deposited: | 16 Sep 2004 |
Last Modified: | 11 Jan 2012 10:18 |
URI: | http://eprints.iisc.ac.in/id/eprint/1858 |
Actions (login required)
![]() |
View Item |