DELISP: Efficient discovery of generalized sequential patterns by delimited pattern-growth technology

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

Volumn 2336, Issue , 2002, Pages 198-209

  Lin, Ming Yen ^a   Lee, Suh Yin ^a   Wang, Sheng Shun ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DISTINCT ELEMENTS; EMPIRICAL EVALUATIONS; GROWTH TECHNIQUES; PROJECTION TECHNIQUES; SEQUENCE DATABASE; SEQUENTIAL PATTERNS; SLIDING TIME WINDOWS; TIME CONSTRAINTS;

DATA MINING;

EID: 33749548754     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47887-6_19     Document Type: Conference Paper

References (14)

1. R. Agrawal and R Srikant,. Mining Sequential Patterns,. Proceedings of the 11th International Conference on Data Engineering, Taipei, Taiwan, pp. 3-14, 1995.
2. C. Bettini, X. S. Wang, and S. Jajodia,. Mining Temporal Relationships with Multiple Granularities in Time Sequences,. Data Engineering Bulletin, Vol. 21, pp. 32-38, 1998.
3. M. N. Garofalakis, R. Rastogi, and K Shim,. SPIRIT: Sequential Pattern Mining with Regular Expression Constraints,. Proceedings of the 25th International Conference on Very Large Data Bases, Edinburgh, Scotland, pp. 223-234, 1999.
4. J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal and M.-C. Hsu, FreeSpan: Frequent pattern-projected sequential pattern mining,. Proceedings of the 6th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 355-359, 2000.
5. M. Y. Lin and S Y Lee,. Incremental Update on Sequential Patterns in Large Databases,. Proceedings of 10th IEEE International Conference on Tools with Artificial Intelligence, Taipei, Taiwan, pp. 24-31, 1998.
6. H. Mannila, H. Toivonen and A. I. Verkamo,. Discovery of Frequent Episodes in Event Sequences,. Data Mining and Knowledge Discovery, Vol. 1, Issue 3, pp. 259-289, 1997.
7. F. Masseglia, F. Cathala, and P. Poncelet,. The PSP Approach for Mining Sequential Patterns,. Proceedings of 1998 2nd European Symposium on Principles of Data Mining and Knowledge Discovery, Vol. 1510, Nantes, France, pp. 176-184, Sep. 1998.
8. T. Oates, M. D. Schmill, D. Jensen, and P R Cohen,. A Family of Algorithms for Finding Temporal Structure in Data,. Proceedings of the 6th International Workshop on AI and Statistics, Fort Lauderdale, Florida, pp. 371-378, 1997.
9. J. Pei, J. Han, H. Pinto, Q. Chen, U. Dayal and M.-C Hsu,. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth,. Proceedings of 2001 International Conference on Data Engineering, pp. 215-224, 2001.
10. T. Shintani and M Kitsuregawa,. Mining algorithms for sequential patterns in parallel: Hash based approach,. Proceedings of the Second Pacific.Asia Conference on Knowledge Discovery and Data mining, pp. 283-294, 1998.
11. R. Srikant and R. Agrawal,. Mining Sequential Patterns: Generalizations and Performance Improvements,. Proceedings of the 5th International Conference on Extending Database Technology, Avignon, France, pp. 3-17, 1996. (An extended version is the IBM Research Report RJ 9994)
12. K. Wang,. Discovering patterns from large and dynamic sequential data,. Journal of Intelligent Information Systems, Vol. 9, No. 1, pp. 33-56, 1997.
13. M. J. Zaki,. Sequence Mining in Categorical Domains: Incorporating Constraints,. Proceedings of the 9th International Conference on Information and Knowledge Management, Washington D.C., pp. 422-429, 2000.
14. M. J. Zaki,. SPADE: An Efficient Algorithm for Mining Frequent Sequences,. Machine Learning Journal, Vol. 42, No. 1/2, pp. 31-60, 2001.