loading...
T-Trees, Vertical Partitioning and Distributed Association Rule Mining
Melbourne, Florida November 19-November 22
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2003.1250965Third IEEE International Conference o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Frans Coenen, The University of Liverpool, UK
Paul Leng, The University of Liverpool, UK
Shakil Ahmed, The University of Liverpool, UK
In this paper we consider a technique (DATA-VP) for distributed (and parallel) Association Rule Mining that makes use of a vertical partitioning technique to distribute the input data amongst processors. The proposed vertical partitioning is facilitated by a novel compressed set enumeration tree data structure (the T-tree), and an associated mining algorithm (Apriori-T), that allows for computationally effective distributed/parallel ARM when compared with existing approaches.
Citation:
Frans Coenen, Paul Leng, Shakil Ahmed, "T-Trees, Vertical Partitioning and Distributed Association Rule Mining," icdm, pp.513, Third IEEE International Conference on Data Mining (ICDM'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions