Scalable Parallel Data Mining for Association Rules

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 26, Issue 2, 1997, Pages 277-288

  Han, Eui Hong ^a   Karypis, George ^a   Kumar, Vipin ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; DATA STRUCTURES; INFORMATION MANAGEMENT; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER);

HYBRID DISTRIBUTION ALGORITHM; INTELLIGENT DATA DISTRIBUTION ALGORITHM; PARALLEL DATA MINING;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0031165409     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/253262.253330     Document Type: Article

References (15)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of 1993 ACM-SIGMOD Int. Conf. on Management of Data, Washington, D.C., 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th VLDB Conference, pages 487-499, Santiago, Chile, 1994.
3. R. Agrawal and J.C. Shafer. Parallel mining of association rules. IEEE Transactions on Knowledge and Data Eng., 8(6):962-969, December 1996.
4. J. Han and Y. Fu. Discovery of multiple-level association rules from large databases. In Proc. of the 21st VLDB Conference, Zurich, Switzerland, 1995.
5. E.H. Han, G. Karypis, and V. Kumar Scalable parallel data mining for association rules. Technical Report TR-97-??, Department of Computer Science, University of Minnesota, M inneapolis, 1997.
6. M. A. W. Houtsma and A. N. Swami. Set-oriented mining for association rules in relational databases. In Proc. of the 11th Int'l Conf. on Data Eng., pages 25-33, Taipei, Taiwan, 1995.
7. Vipin Kumar, Ananth Grama, Anshul Gupta, and George Karypis. Introduction to Parallel Computing: Algorithm Design and Analysis. Benjamin Cummings/ Addison Wesley, Redwod City, 1994.
8. B. Mobasher, N. Jain, E.H. Han, and J. Srivastava. Web mining: Pattern discovery from world wide web transactions. Technical Report TR-96-050, Department of Computer Science, University of Minnesota, M inneapolis, 1996.
9. H. Mannila, H. Toivonen, and A. I. Verkamo. Discovering frequent episodes in sequences. In Proc. of the First Int'l Conference on Knowledge Discovery and Data Mining, pages 210-215, Montreal, Quebec, 1995.
10. IBM Quest Data Mining Project. Quest synthetic data generation code. http://www.almaden.ibm.com/cs/quest/syndata.html, 1996.
11. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.
12. R. Srikant and R. Agrawal. Mining generalized association rules. In Proc. of the 21st VLDB Conference, pages 407-419, Zurich, Switzerland, 1995.
13. R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In Proc. of the Fifth Int'l Conference on Extending Database Technology, Avignon, France, 1996.
14. M. Stonebraker, R. Agrawal, U. Dayal, E. J. Neuhold, and A. Reuter. DBMS research at a crossroads: The vienna update. In Proc. of the 19th VLDB Conference, pages 688-692, Dublin, Ireland, 1993.
15. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. of the 21st VLDB Conference, pages 432-443, Zurich, Switzerland, 1995.