A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text
René Arnulfo García-Hernández, José Fco. Martínez-Trinidad, Jesús Ariel Carrasco-Ochoa · Lecture notes in computer science · 2004
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. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.