Abstract
In this paper, we present an approach, called PSP, for mining sequential patterns embedded in a database. Close to the pIoblem of discovering association rules, mining sequential patterns requires handling time constraints. Originally introduced in [3], the issue is addressed by the GSP approach [10]. Our proposal resumes the general principles of GSP but it makes use of a different intermediary data structure which is proved to be more efficient than in GSP.
Cite
CITATION STYLE
Masseglia, F., Cathala, F., & Poncelet, P. (1998). The PSP approach for mining sequential patterns. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1510, pp. 176–184). Springer Verlag. https://doi.org/10.1007/bfb0094818
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
