论文信息 - Using Finite State Automata for Sequence Mining

Using Finite State Automata for Sequence Mining

We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the model.

Philip Hingston

[1] Mark Levene,et al. Data Mining of User Navigation Patterns , 1999, WEBKDD.

[2] Ramakrishnan Srikant,et al. Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[3] Umeshwar Dayal,et al. PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth , 2001, ICDE 2001.

[4] Usama M. Fayyad. The digital physics of data mining , 2001, CACM.

[5] Enrique Vidal,et al. What Is the Search Space of the Regular Inference? , 1994, ICGI.

[6] WebUsersMyra Spiliopoulou,et al. A Data Miner analyzing the Navigational Behaviour of , 1999 .

[7] José Oncina,et al. Learning Stochastic Regular Grammars by Means of a State Merging Method , 1994, ICGI.

[8] Ramakrishnan Srikant,et al. Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.

[9] Philip Hingston,et al. Inference of regular languages using model simplicity , 2001, Proceedings 24th Australian Computer Science Conference. ACSC 2001.

[10] Qiming Chen,et al. PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth , 2001, Proceedings 17th International Conference on Data Engineering.