Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11925231_65 | MICAI |
Keywords | Field | DocType |
sequential pattern,minesp node,inductive query,best suit,mining sequential pattern,traditional query tree,minesp operator,mining algorithm,relational-like operator,query tree,execution environment condition,inductive databases,spminer prototype system | Data mining,Query language,Tree (graph theory),Computer science,Artificial intelligence,Operator (computer programming),Query optimization,Web search query,Regular expression,Deductive database,Sargable,Machine learning,Database | Conference |
Volume | ISSN | ISBN |
4293 | 0302-9743 | 3-540-49026-4 |
Citations | PageRank | References |
0 | 0.34 | 25 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Edgard Benítez-Guerrero | 1 | 9 | 10.06 |
| Alma-Rosa Hernández-López | 2 | 0 | 0.34 |