Parallel data mining for association rules on shared-memory multi-processors

Proceedings of the International Conference on Supercomputing

Volumn 1996-November, Issue , 1996, Pages

  Zaki, M J ^a   Ogihara, M ^a   Parthasarathy, S ^a   Li, W ^a  

^a NONE

Author keywords

Association Rules; Data Mining; Hash Tree Balancing; Hashing; Load Balancing; Shared Memory Multi processor

Indexed keywords

ASSOCIATION RULES; MEMORY ARCHITECTURE; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; TREES (MATHEMATICS);

HASH TREE BALANCING; HASH TREES; HASHING; LOAD-BALANCING; MINING OF ASSOCIATION RULES; OPTIMISATIONS; PARALLEL DATA MINING; RESEARCH AREAS; SHARED MEMORY MULTIPROCESSOR; SIGNIFICANT PATTERNS;

DATA MINING;

EID: 77956461676     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SUPERC.1996.183545     Document Type: Conference Paper

References (14)

1. R. Agrawal, T. Imielinski, and A. Swami. Database mining: A performance perspective. In IEEE Trans. on Knowledge and Data Engg., pages 5(6):914–925, 1993.
2. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD Intl. Conf. Management of Data, May 1993.
3. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In U. F. et al, editor, Advances in Knowledge Discovery and Data Mining. MIT Press, 1996.
4. R. Agrawal and J. Shafer. Parallel mining of association rules: design, implementation, and experience. Technical Report RJ10004, IBM Almaden Research Center, San Jose, CA 95120, Jan. 1996.
5. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 20th VLDB Conf., Sept. 1994.
6. M. Cierniak, W. Li, and M. J. Zaki. Loop scheduling for heterogeneity. In 4th IEEE Intl. Symposium on High-Performance Distributed Computing, also as URCS-TR 540, CS Dept., Univ. of Rochester, Aug. 1995.
7. M. Holsheimer, M. Kersten, H. Mannila, and H. Toivonen. A perspective on databases and data mining. In 1st Intl. Conf. Knowledge Discovery and Data Mining, Aug. 1995.
8. M. Houtsma and A. Swami. Set-oriented mining of association rules. In RJ 9567. IBM Almaden, Oct. 1993.
9. H. Mannila, H. Toivonen, and I. Verkamo. Efficient algorithms for discovering association rules. In AAAI Wkshp. Knowledge Discovery in Databases, July 1994.
10. J. S. Park, M. Chen, and P. S. Yu. An effective hash based algorithm for mining association rules. In Proc. ACM SIGMOD Intl. Conf. Management of Data, May 1995.
11. J. S. Park, M. Chen, and P. S. Yu. Efficient parallel data mining for association rules. Technical Report RC20156, IBM T. J. Watson Research Center, Aug. 1995.
12. G. Piatetsky-Shapiro. Discovery, presentation and analysis of strong rules. In G. P.-S. et al, editor, KDD. AAAI Press, 1991.
13. A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. In Proc. 21st VLDB Conf., 1995.
14. M. J. Zaki, M. Ogihara, S. Parthasarathy, and W. Li. Parallel data mining for association rules on shared-memory multi-processors. Technical Report 618, Department of Computer Science, University of Rochester, 618 1996.