Cited in
(42)- Fast discovery of sequential patterns in large databases using effective time-indexing
- A survey of temporal data mining
- PRISM: an effective approach for frequent sequence mining via prime-block encoding
- Frequency-based views to pattern collections
- Abstraction and mining of traces to explain concurrency bugs
- MARBLES: Mining association rules buried in long event sequences
- Horn axiomatizations for sequential data
- DMTL
- PlanMine
- SPADE
- CP-miner
- gSpan
- Perracotta
- RankGene
- Goldilocks
- Xproj
- SMArTIC
- Ranking episodes using a partition model
- APEX
- PRIX
- ViST
- PrefixSpan
- AVIO
- bzip2smp
- CHESS
- CTrigger
- Falcon
- Carpenter
- COBBLER
- CLOSET
- TelegraphCQ
- RESUME
- CloseGraph
- CloSpan
- Finding top-\(k\) covering irreducible contrast sequence rules for disease diagnosis
- Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining
- Models of representation of fuzzy temporal knowledge in databases of temporal series
- Discovering injective episodes with general partial orders
- Mining closed strict episodes
- Frequent temporal pattern mining with extended lists
- Discovering pan-correlation patterns from time course data sets by efficient mining algorithms
- Efficiently mining cohesion-based patterns and rules in event sequences
This page was built for software: BIDE
