loading...
Mining Quantitative Frequent Itemsets Using Adaptive Density-Based Subspace Clustering
Houston, Texas November 27-November 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2005.100Fifth 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 
   
Takashi Washio, Osaka University
Yuki Mitsunaga, Osaka University
Hiroshi Motoda, Osaka University
A novel approach to subspace clustering is proposed to exhaustively and efficiently mine quantitative frequent itemsets (QFIs) from massive transaction data¹. For the computational tractability, our approach introduces adaptive density-based and Apriori-like algorithm. Its outstanding performance is shown through numerical experiments.
Citation:
Takashi Washio, Yuki Mitsunaga, Hiroshi Motoda, "Mining Quantitative Frequent Itemsets Using Adaptive Density-Based Subspace Clustering," icdm, pp.793-796, Fifth IEEE International Conference on Data Mining (ICDM'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.