Adaptive and resource-aware mining of frequent sets

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2002, Pages 338-345

  Orlando, S ^a   Palmerini, P ^a,b   Perego, R ^b   Silvestri, F ^b,c  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b ISTI CNR   (Italy)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78149303569     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. R. C. Agarwal, C. C. Aggarwal, and V.V.V. Prasad. A Tree Projection Algorithm for Generation of Frequent Itemsets. JPDC, 2000. Special Issue on High Performance Data Mining.
2. R. C. Agarwal, C. C. Aggarwal, and V.V.V. Prasad. Depth first generation of long patterns. In Proc. of the 6th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pages 108-118, 2000.
3. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Inkeri Verkamo. Fast Discovery of Association Rules in Large Databases. In Advances in Knowledge Discovery and Data Mining, pages 307-328. AAAI Press, 1996.
4. R. Agrawal and J. C. Shafer. Parallel mining of association rules. IEEE TKDE, 8:962-969, 996.
5. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. In Proc. of the 20th VLDB Conf., pages 487-199, 1994.
6. R. Baraglia, D. Laforenza, S. Orlando, P. Palmerini, and R. Perego. Implementation issues in the design of I/O intensive data mining applications on clusters of workstations. In Proc. of the 3rd HPDM Workshop, (IPDPS-2000), Cancun, Mexico, pages 350-357. LNCS 1800 Spinger-Verlag, 2000.
7. Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. ACM SIGKDD Explorations Newsletter, 2(2): 66-75, December 2000.
8. R. J. Bayardo Jr. Efficiently Mining Long Patterns from Databases. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pages 85-93, Seattle, Washington. USA. 1998.
9. Brian Dunkel and Nandit Soparkar. Data organization and access for efficient data mining. In Proc. of the I5th Int. Conf. on Data Engineering, pages 522-529, Sydney, Australia, 1999. IEEE Computer Society.
10. E. H. Han, G. Karypis, and Kumar V. Scalable Parallel Data Mining for Association Rules. IEEE TKDE, 12(3):337-352, May/June 2000.
11. J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pages 1-12, Dallas, Texas, USA, 2000.
12. rd Int. Conf. on Data Warehousing and Knowledge Discovery, DaWaK 2001, LNCS 2114, pages 71-82, Munich, Germany, 2001.
13. J. S. Park, M.-S. Chen, and P. S. Yu. An Effective Hash Based Algorithm for Mining Association Rules. In Proc. of the 1995 ACM SIGMOD Int. Conf. on Management of Data, pages 175-186, 1995.
14. J. Pei, J. Han, H. Lu, S. Nishio, and D. Tang, S. amd Yang. H-Mine: Hyper-Structure Mining of Frequent Patterns in Large Databases. In Proc. of the 2001 IEEE ICDM Conf., San Jose, CA, USA, 2001.
15. A. Savasere, E. Omiecinski, and S. B. Navathe. An Efficient Algorithm for Mining Association Rules in Large Databases. In Proc. of the 21th VLDB Conf., pages 432-444, Zurich, Switzerland, 1995.
16. M. J. Zaki. Scalable algorithms for association mining. IEEE TKDE, 12:372-390, May/June 2000.
17. Z. Zheng, R. Kohavi, and L. Mason. Real World Performance of Association Rule Algorithms. In Proc. of KDD-2001, 2001.