A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text

A Fast Algorithm to Find All the Maximal Frequent Sequences in a Text

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 patter...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: García-Hernández, René A., Martínez-Trinidad, José Fco, Carrasco-Ochoa, Jesús Ariel
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Exact sciences and technology
Fast Algorithm
Frequent Sequence
Pattern recognition. Digital image processing. Computational geometry
Position Node
Sequential Pattern
Text Mining
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-30463-0_60