Distributed mining of maximal frequent itemsets from databases on a cluster of workstations

2004 IEEE International Symposium on Cluster Computing and the Grid, CCGrid 2004

Volumn , Issue , 2004, Pages 499-507

  Chung, Soon M ^a   Luo, Congnan ^a  

^a Wright State University   (United States)

Author keywords

Association rules; Distributed data mining; Maximal frequent itemsets; Scalability

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER WORKSTATIONS; DATA REDUCTION; DATABASE SYSTEMS; MATHEMATICAL MODELS; SYNCHRONIZATION;

DISTRIBUTED DATA MINING (DDM); MAXIMAL FREQUENT ITEMSETS; SCALABILITY;

DATA MINING;

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

References (6)

1. R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Proc. of the 20th VLDB Conf., 1994, pp. 487-499.
2. R. Agrawal and J. C. Shafer, "Parallel Mining of Association Rules," IEEE Trans. on Knowledge and Data Engineering, Vol. 8, No. 6, 1996, pp. 962-969.
3. R. J. Bayardo, "Efficient Mining Long Patterns from Databases, " Proc. of the ACM SIGMOD Int'l Conf. on Management of Data, 1998, pp. 85-93.
4. S. M. Chung and J. Yang, "A Parallel Distributive Join Algorithm for Cube-Connected Multiprocessors," IEEE Trans. on Parallel and Distributed Systems, Vol. 7, No. 2, 1996, pp. 127-137.
5. M. Snir, S. Otto, S. Huss-Lederman, D. Walker, and J. Dongarra, MPI: The Complete Reference, The MIT Press, 1996.
6. R. Rymon, "Search through Systematic Set Enumeration," Proc. of 3rd Int'l Conf. on Principles of Knowledge Representation and Reasoning, 1992, pp. 539-550.