Multi-Level Linear Location Tree for Efficient Sequential Pattern Mining

[1] Jian Pei, JiaWei Han, Behzad Mortazavi-Asl, and Helen Pinto: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth,(ICDE'01).

DOI: 10.1109/icde.2001.914830

Google Scholar

[2] F. Masseglia, P. Poncelet and M. Teisseire : Incremental Mining of Sequential Patterns in Large Databases, (BDA'00).

DOI: 10.1016/s0169-023x(02)00209-4

Google Scholar

[3] Rakesh Agrawal and Ramakrishnan Srikant: Mining Sequential Patterns, (11th International Conference on Data Enginneering, 1995).

Google Scholar

[4] Ramakrishnan Srikant and Rakesh Agrawal: Mining Sequential Patterns: Generalizations and Performance Improvements, (EDBT, 1996).

DOI: 10.1007/bfb0014140

Google Scholar

[5] Jiawei Han, Jian Pei, Behzad Mortzavi-Asl, Qiming Chen Umeshwar Dayal, and Mei-Chun Hsu: FreeSpan: Frequent Pattern-Projected Sequential pattern Mining, (SIGKDD 2000).

DOI: 10.1109/icde.2001.914830

Google Scholar

[6] Dong-Ha Lee: Methods for Finding Association Rules in Large Relational Database Using Multi-Level Linear Sequence Tree and Concept Hierarchy, (Ph.D. Thesis, POSTECH, Korea 2000).

Google Scholar

[7] Mohanned J. Zaki: Efficient enumeration of frequent sequences, (7th International Conference on Information and Knowledge Management, 1998).

Google Scholar

[8] Rakesh Agrawal, Tomasz Imielinski, Arun Swami: Mining Association Rules between Sets of Items in Large Databases, (ACM SIGMOD International Conference on Mangement of Data, 1993).

DOI: 10.1145/170035.170072

Google Scholar

[9] Ke Wang, Yu He, Jiawei Han: Mining Frequent Itemsets Using Support Constraints, (VLDB, 2000).

Google Scholar

[10] Rakesh Agrawal, Ramakrishnan Srikant: Fast Algorithms for Mining Association Rules, (VLDB, 1994).

Google Scholar

[11] Dao-I Lin, Zvi M. Kedem: Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set, (EDBT, 1998).

DOI: 10.1007/bfb0100980

Google Scholar