Fast discovery of sequential patterns in large databases using effective time-indexing
From MaRDI portal
Recommendations
- DELISP: Efficient discovery of generalized sequential patterns by delimited pattern-growth technology
- Fast discovery of sequential patterns by memory indexing
- Mining sequential patterns across time sequences
- scientific article; zbMATH DE number 2020222
- Discovering local patterns from multiple temporal sequences
Cites work
Cited in
(10)- Sequential index structure for content-based retrieval
- Discovering sequential association rules with constraints and time lags in multiple sequences
- Discovering important sequential patterns with length-decreasing weighted support constraints
- Fast discovery of sequential patterns by memory indexing
- scientific article; zbMATH DE number 2020222 (Why is no real title available?)
- Processing Sequential Patterns in Relational Databases
- A fast algorithm for mining sequential patterns from large databases
- Discovering exclusive patterns in frequent sequences
- A near-optimal database allocation for reducing the average waiting time in the grid computing environment
- Mining sequential patterns across time sequences
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)