loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fourth IEEE International Conference on Data Mining (ICDM'04)
Mining Frequent Itemsets from Secondary Memory
Brighton, United Kingdom
November 01-November 04
ISBN: 0-7695-2142-8
G?sta Grahne, Concordia University, Montreal, Canada
Jianfei Zhu, Concordia University, Montreal, Canada
Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically for main memory databases. In this paper, we investigate approaches to mining frequent itemsets when the database or the data structures used in the mining are too large to fit in main memory. Experimental results show that our techniques reduce the required disk accesses by orders of magnitude, and enable truly scalable data mining.
Citation:
G?sta Grahne, Jianfei Zhu, "Mining Frequent Itemsets from Secondary Memory," icdm, pp.91-98, Fourth IEEE International Conference on Data Mining (ICDM'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.