Fast discovery of sequential patterns in large databases using effective time-indexing
From MaRDI portal
Recommendations
Cites work
Cited in
(10)- Mining sequential patterns across time sequences
- scientific article; zbMATH DE number 2089468 (Why is no real title available?)
- scientific article; zbMATH DE number 1700003 (Why is no real title available?)
- scientific article; zbMATH DE number 2020222 (Why is no real title available?)
- scientific article; zbMATH DE number 1945797 (Why is no real title available?)
- Discovering important sequential patterns with length-decreasing weighted support constraints
- Processing Sequential Patterns in Relational Databases
- A near-optimal database allocation for reducing the average waiting time in the grid computing environment
- Discovering exclusive patterns in frequent sequences
- A fast algorithm for mining sequential patterns from large databases
This page was built for publication: Fast discovery of sequential patterns in large databases using effective time-indexing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955236)