The problem of mining sequential patterns has been widely studied and many efficient algorithms used to solve this problem have been published. In some cases, there can be implicitly or explicitely defined taxonomies (hierarchies) over input items (e.g. product categories in a e-shop or sub-domains in the DNS system). However, how to deal with taxonomies in sequential pattern mining is marginally discussed. In this paper, we formulate the problem of mining hierarchically-closed multilevel sequential patterns and demonstrate its usefulness. The MLSP algorithm based on the on-demand generalization that outperforms other similar algorithms for mining multi-level sequential patterns is presented here. ©Springer-Verlag 2013.
CITATION STYLE
Šebek, M., Hlosta, M., Zendulka, J., & Hruška, T. (2013). MLSP: Mining hierarchically-closed multi-level sequential patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8346 LNAI, pp. 157–168). https://doi.org/10.1007/978-3-642-53914-5_14
Mendeley helps you to discover research relevant for your work.