Mining of association rules in very large databases: A structured parallel approach

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

Volumn 1685 LNCS, Issue , 1999, Pages 1441-1450

  Becuzzi, P ^a   Coppola, M ^a   Vanneschi, M ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; COMPUTER PROGRAMMING; DATA MINING; SOFTWARE TESTING;

DATA MINING ALGORITHM; MINING OF ASSOCIATION RULES; PARALLEL PROGRAM; PARALLELIZING; PERFORMANCE PORTABILITY; SOURCE CODES; STRONG DEMAND; VERY LARGE DATABASE;

PARALLEL ARCHITECTURES;

EID: 0005204908     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48311-x_204     Document Type: Conference Paper

References (12)

1. R. Agrawal and J.C. Shafer. Parallel mining of association rules: Design, implementation and experience. IEEE Transactions on Knowledge and Data Engineering, 8(6), December 1996. IBM Research Report RJ 10004, January 1996.
2. P. Becuzzi, M. Coppola, D. Laforenza, S. Ruggieri, D. Talia, and M. Vanneschi. Data analysis and data mining with parallel architectures: Techniques and experiments. Technical report, project "Parallel Intelligent Systems for Tax Fraud Detection", December 1998.
3. U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors. Advances in Knowledge Discovery and Data Mining. AAAI press / MIT press, 1996.
4. D. Gunopulos, H. Mannila, R. Khardon, and H. Toivonen. Data mining, hypergraph transversals, and machine learning (ext. abstract). In PODS '97. Proc. of the 16th ACM Symposium on Principles of Database Systems, May 1997, Tucson, Arizona, pages 209-216, New York, 1997. ACM Press.
5. E.H. Han, G. Karypis, and V. Kumar. Scalable parallel data mining for association rules. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, volume 26, 2 of SIGMOD Record, pages 277-288, New York, May13-15 1997. ACM Press. (Pubitemid 127456792)
6. Andreas Mueller. Fast sequential and parallel algorithms for association rule mining: A comparison. Technical Report CS-TR-3515, Dept. of Computer Science, Univ. of Maryland, College Park, MD, August 1995.
7. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In U. Dayal, P.M.D. Gray, and S. Nishio, editors, VLDB '95: Proc. of the 21st Int. Conf. on Very Large Data Bases, Zurich, Switzerland, pages 432-444, Los Altos, CA, 1995. Morgan Kaufmann Publishers.
8. T. Shintani and M. Kitsuregawa. Hash based parallel algorithms for mining association rules. In PDIS '96: 4th Int. Conf. on Parallel and Distributed Information Systems, pages 19-30, Los Alamitos, Ca., USA, December 1996. IEEE Computer Society Press.
9. M. Vanneschi. Heterogeneous HPC Environments. In David Pritchard and Jeff Reeve, editors, Euro-Par '98 Parallel Processing, volume 1470 of LNCS, pages 21-34, Southampton, UK, September 1998. ACM / IFIR, Springer-Verlag. (Pubitemid 128125054)
10. M. Vanneschi. PQE2000: HPC tools for industrial applications. IEEE Concurrency: Parallel, Distributed & Mobile Computing, 6(4):68-73, Oct-Dec 1998. (Pubitemid 128566727)
11. M.J. Zaki. Scalable Data Mining for Rules. PhD thesis, University of Rochester, Rochester, New York, 1998.
12. M.J. Zaki, S. Parthasarathy, and M. Ogihara. Parallel algorithms for discovery of association rules. In Data Mining and Knowledge Discovery, volume 1. Kluwer Academic Publishers, 1997.