Parallel algorithms for discovery of association rules

Data Mining and Knowledge Discovery

Volumn 1, Issue 4, 1997, Pages 343-373

  Zaki, Mohammed J ^a,c   Parthasarathy, Srinivasan ^a,d   Ogihara, Mitsunori ^a   Li, Wei ^b  

^a University of Rochester   (United States)

^b ORACLE CORPORATION   (United States)

^c UNIVERSITY OF ROCHESTER   (United States)

^d UNIVERSITY OF CINCINNATI   (United States)

Author keywords

Association rules; Lattice traversal; Maximal hypergraph cliques; Parallel data mining

Indexed keywords

EID: 21944439686     PISSN: 13845810     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009773317876     Document Type: Article

References (24)

1. Agrawal, R., and Shafer, J. 1996. Parallel mining of association rules. In IEEE Trans. on Knowledge and Data Engg., 8(6):962-969.
2. Agrawal, R., and Srikant, R. 1994. Fast algorithms for mining association rules. In 20th VLDB Conf.
3. Agrawal, R.; Mannila, H.; Srikant, R.; Toivonen, H.; and Verkamo, A. I. 1996. Fast discovery of association rules. In Fayyad, U., and et al., eds., Advances in Knowledge Discovery and Data Mining. MIT Press.
4. Agrawal, R.; Imielinski, T.; and Swami, A. 1993. Mining association rules between sets of items in large databases. In ACM SIGMOD Intl. Conf. Management of Data.
5. Berge, C. 1989. Hypergraphs: Combinatorics of Finite Sets. North-Holland.
6. Cheung, D.; Han, J.; Ng, V.; Fu, A.; and Fu, Y. 1996a. A fast distributed algorithm for mining association rules. 4th Intl. Conf. Parallel and Distributed Info. Systems.
7. Cheung, D.; Ng, V.; Fu, A.; and Fu, Y. 1996b. Efficient mining of association rules in distributed databases. In IEEE Trans. on Knowledge and Data Engg., 8(6):911-922.
8. Fayyad, U.; Piatetsky-Shapiro, G.; and Smyth, P. 1996. The KDD process for extracting useful knowledge from volumes of data. In Communications of the ACM - Data Mining and Knowledge Discovery in Databases.
9. Garey, M. R., and Johnson, D.S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co.
10. Gillett, R. 1996. Memory channel: An optimized cluster interconnect. In IEEE Micro, 16(2).
11. Han, E.-H.; Karypis, G.; and Kumar, V. 1997. Scalable parallel data mining for association rules. In ACM SIGMOD Conf. Management of Data.
12. Holsheimer, M.; Kersten, M.; Mannila, H.; and Toivonen, H. 1995. A perspective on databases and data mining. In 1st Intl. Conf. Knowledge Discovery and Data Mining.
13. Houtsma, M., and Swami, A. 1995. Set-oriented mining of association rules in relational databases. In 11th Intl. Conf. Data Engineering.
14. Mannila, H.; Toivonen, H.; and Verkamo, I. 1994. Efficient algorithms for discovering association rules. In AAAI Wkshp. Knowledge Discovery in Databases.
15. Park, J. S.; Chen, M.; and Yu, P. S. 1995a. An effective hash based algorithm for mining association rules. In ACM SIGMOD Intl. Conf. Management of Data.
16. Park, J. S.; Chen, M.; and Yu, P. S. 1995b. Efficient parallel data mining for association rules. In ACM Intl. Conf. Information and Knowledge Management.
17. Parthasarathy, S.; Zaki, M. J.; and Li, W. 1997. Application driven memory placement for dynamic data structures. Technical Report URCS TR 653, University of Rochester.
18. Savasere, A.; Omiecinski, E.; and Navathe, S. 1995. An efficient algorithm for mining association rules in large databases. In 21st VLDB Conf.
19. Toivonen, H. 1996. Sampling large databases for association rules. In 22nd VLDB Conf.
20. Zaki, M. J.; Ogihara, M.; Parthasarathy, S.; and Li, W. 1996. Parallel data mining for association rules on shared-memory multi-processors. In Supercomputing'96.
21. Zaki, M. J.; Parthasarathy, S.; Li, W.; and Ogihara, M. 1997a. Evaluation of sampling for data mining of association rules. In 7th Intl. Wkshp. Research Issues in Data Engg.
22. Zaki, M. J.; Parthasarathy, S.; Ogihara, M.; and Li, W. 1997b. New algorithms for fast discovery of association rules. In 3rd Intl. Conf. on Knowledge Discovery and Data Mining.
23. Zaki, M. J.; Parthasarathy, S.; Ogihara, M.; and Li, W. 1997c. New algorithms for fast discovery of association rules. Technical Report URCS TR 651, University of Rochester.
24. Zaki, M. J.; Parthasarathy, S.; and Li, W. 1997. A localized algorithm for parallel association mining. In 9th ACM Symp. Parallel Algorithms and Architectures.