T-Trees, Vertical Partitioning and Distributed Association Rule Mining

  • Authors:
  • Frans Coenen;Paul Leng;Shakil Ahmed

  • Affiliations:
  • -;-;-

  • Venue:
  • ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we consider a technique (DATA-VP) fordistributed (and parallel) Association Rule Mining thatmakes use of a vertical partitioning technique to distributethe input data amongst processors. The proposed verticalpartitioning is facilitated by a novel compressed set enumerationtree data structure (the T-tree), and an associatedmining algorithm (Apriori-T), that allows for computationallyeffective distributed/parallel ARM when compared withexisting approaches.