Abstract
This paper introduces MineSP, a relational-like operator to mine sequential patterns from databases. It also shows how an inductive query can be translated into a traditional query tree augmented with MineSP nodes. This query tree is then optimized, choosing the mining algorithm that best suits the constraints specified by the user and the execution environment conditions. The SPMiner prototype system supporting our approach is also presented. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Benítez-Guerrero, E., & Hernández-López, A. R. (2006). The MineSP operator for mining sequential patterns in inductive databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4293 LNAI, pp. 684–694). Springer Verlag. https://doi.org/10.1007/11925231_65
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
