Parallel tree projection algorithm for sequence mining

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

Volumn 2150, Issue , 2001, Pages 310-320

  Guralnik, Valerie ^a   Garg, Nivea ^a   Karypis, George ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; LARGE DATASET;

DISTRIBUTED-MEMORY PARALLEL COMPUTERS; EXPERIMENTAL EVALUATION; LARGE DATABASE; PARALLEL FORMULATION; SCALABLE ALGORITHMS; SEQUENCE MINING; SEQUENTIAL PATTERNS; TREE PROJECTIONS;

TREES (MATHEMATICS);

ALGORITHMS; COMPUTERS; PATTERNS;

EID: 34247367759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44681-8_44     Document Type: Conference Paper

References (13)

1. R. Aggrawal and R. Srikant. Mining sequential patterns. In Proc. of the Int’l Conference on Data Engineering (ICDE), Taipei, Taiwan, 1996.
2. 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.
3. 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.
4. Mahesh V. Joshi, George Karypis, and Vipin Kumar. Universal formulation of sequential patterns. Technical report, Universit of Minnesota, Department of Computer Science, Minneapolis, 1999.
5. Mohammed J. Zaki. Parallel sequence mining on smp machines. In Workshop On Large-Scale Parallel KDD Systems (in conjunction 5th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 57–65, San Diego, CA, august 1999.
6. M. J. Zaki. Efficient enumeration of frequent sequences. In 7th International Conference on Information and Knowledge Management, 1998.
7. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th VLDB Conference, pages 487–499, Santiago, Chile, 1994.
8. Valerie Guralnik, Nivea Garg, and George Karypis. Parallel tree projection algorithm for sequence mining. Technical Report 01–017, Department of Computer Science, University of Minnesota, 2001.
9. Vipin Kumar, Ananth Grama, Anshul Gupta, and George Karypis. Introduction to Parallel Computing: Design and Analysis of Algorithms. Benjamin/Cummings Publishing Company, Redwood City, CA, 1994.
10. E. H. Han, G. Karypis, and V. Kumar. Scalable parallel data mining for association rules. IEEE Transactions on Knowledge and Data Eng. (accepted for publication), 1999.
11. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, McGraw-Hill, New York, NY, 1990.
12. G. Karypis and V. Kumar. Multilevel algorithms for multi-constraint graph partitioning. In Proceedings of Supercomputing, 1998. Also available on WWW at URL http://www.cs. umn. edu/˜karypis.
13. G. Karypis and V. Kumar. metis: Unstructured graph partitioning and sparse matrix ordering system. Technical report, Department of Computer Science, University of Minnesota, 1995. Available on the WWW at URL http://www.cs. umn. edu/˜karypis/metis/metis.html.