Parallel branch-and-bound graph search for correlated association rules

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

Volumn 1759, Issue , 2002, Pages 127-144

  Morishita, Shinichi ^a   Nakaya, Akihiro ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATION RULES; DATA MINING; OPTIMIZATION;

BRANCH AND BOUNDS; COMPUTATION TIME; GRAPH SEARCH ALGORITHM; OPTIMAL ASSOCIATION; OPTIMIZATION PROBLEMS; PARALLEL BRANCH AND BOUNDS; SEARCH SPACES; SHARED MEMORY MULTIPROCESSOR;

PARALLEL PROCESSING SYSTEMS;

EID: 84949511065     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (12)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD, pages 207-216, May 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Pro- ceedings of VLDB Conference, pages 487-499, 1994.
3. G. Y. Ananth, V. Kumar, and P. Pardalos. Parallel processing of discrete opti- mization problems. 1993.
4. D. Avis and K. Fukuda. A basis enumeration algorithm for linear systems with geometric applications. Applied Mathematics Letters, 5:39-42, 1991.
5. S. Brin, R. Motwani, and C. Silverstein. Beyond market baskets: Generalizing association rules tocorrelations. In Proceedings of ACM SIGMOD, pages 265-276. SIGMOD Record 26(2), June 1997.
6. V. Kumar, A. Grama, and G. Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin Cummings, Nov. 1993.
7. S. Morishita. On classification and regression. In Proceedings of Discovery Science, DS'98, Lecture Notes in Artificial Intelligence, volume 1532, pages 40-57, Dec. 1998.
8. R. T. Ng, L. V. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained association rules. In Proceedings of ACM SIGMOD, pages 13-24, June 1998.
9. J. S. Park, M.-S. Chen, and P. S. Yu. An effective hash-based algorithm for mining association rules. In Proceedings of ACM SIGMOD, pages 175-186, May 1995.
10. R. J. Bayardo Jr. Efficiently Mining Long Patterns from Databases. In Proceedings of ACM SIGMOD, pages 85-93, June 1998.
11. R. J. Bayardo Jr., R. Agrawal, D. Gunopulos. Constraint-Based Rule Mining in Large, Dense Databases. In Proceedings of ICDE, pages 188-197, March 1999.
12. R. Srikant and R. Agrawal. Mining quantitative association rules in large relational tables. In Proceedings of ACM SIGMOD, June 1996.