Abstract
One of the sequential pattern mining problems is to find the maximal frequent sequences in a database with a support. In this paper, we propose a new algorithm to find all the maximal frequent sequences in a text instead of a database. Our algorithm in comparison with the typical sequential pattern mining algorithms avoids the joining, pruning and text scanning steps. Some experiments have shown that it is possible to get all the maximal frequent sequences in a few seconds for medium texts. © Springer-Verlag 2004.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
García-Hernández, R. A., Martínez-Trinidad, J. F., & Carrasco-Ochoa, J. A. (2004). A fast algorithm to find all the maximal frequent sequences in a text. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3287, 478–486. https://doi.org/10.1007/978-3-540-30463-0_60
Readers' Seniority
Readers' Discipline
