An efficient parallel and distributed algorithm for counting frequent sets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2565, Issue , 2003, Pages 421-435

  Orlando, Salvatore ^a   Palmerini, Paolo ^a,b   Perego, Raffaele ^b   Silvestri, Fabrizio ^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

DATA MINING; SHAPE MEMORY EFFECT;

COMMUNICATION OVERHEADS; DATA MINING COMMUNITY; EXPERIMENTAL EVALUATION; MULTI-THREADED ALGORITHMS; OPTIMAL PERFORMANCE; PARALLEL AND DISTRIBUTED ALGORITHMS; PARTITIONING TECHNIQUES; TRANSACTIONAL DATABASE;

ALGORITHMS;

EID: 35248817437     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36569-9_28     Document Type: Article

References (16)

1. 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.
2. R. Agrawal and J. C. Shafer. Parallel Mining of Association Rules. IEEE Transaction On Knowledge And Data Engineering, 8:962-969, 1996.
3. R. Agrawal and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases. In Proc. of the 20th VLDB Conf., pages 487-499, 1994.
4. 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 Work, on High Performance Data Mining, (IPDPS-2000), Cancun, Mexico, pages 350-357. LNCS 1800 Spinger-Verlag, 2000.
5. R. J. Bayardo. Efficiently Mining Long Patterns from Databases. In Proc. of the ACM SIGMOD Intl. Conf. on Management of Data, pages 85-93, 1998.
6. U.M. Fayyad, G. Piatetsky-Shapiro, P. Smith, and R. Uthurusamy, editors. Advances in Knowledge Discovery and Data Mining. AAAI Press, 1998.
7. V. Ganti, J. Gehrke, and R. Ramakrishnan. Mining Very Large Databases. IEEE Computer, 32(8):38-45, 1999.
8. E. H. Han, G. Karypis, and Kumar V. Scalable Parallel Data Mining for Association Rules. IEEE Transactions on Knowledge and Data Engineering, 12(3):337-352, May/June 2000.
9. 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.
10. Hipp, J. and Güntzer, U. and Nakhaeizadeh, G. Algorithms for Association Rule Mining - A General Survey and Comparison. SIGKDD Explorations, 2(1):58-64, June 2000.
11. S. Orlando, P. Palmerini, and R. Perego. Enhancing the Apriori Algorithm for Frequent Set Counting. In Proc. of the 3rd Int. Conf. on Data Warehousing and Knowledge Discovery, LNCS 2114, pages 71-62, Germany, 2001.
12. S. Orlando, P. Palmerini, R. Perego, and F. Silvestri. Adaptive and ResourceAware Mining of Frequent Sets. In Proc. of the 2002 IEEE Int. Conference on Data Mining (ICDM'02), Maebashi City, Japan, Dec. 2002.
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. 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.
15. M. J. Zaki. Parallel and Distributed Association Mining: A Survey. IEEE Concurrency, 7(4):14-25, 1999.
16. M. J. Zaki. Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering, 12:372-390, May/June 2000.