The following pages link to PrefixSpan (Q32576):
Displaying 40 items.
- e-NSP: efficient negative sequential pattern mining (Q274424) (← links)
- Improving constrained pattern mining with first-fail-based heuristics (Q408638) (← links)
- Concordance and consensus (Q545367) (← links)
- Abstraction and mining of traces to explain concurrency bugs (Q681463) (← links)
- Interactive sequence discovery by incremental mining (Q704141) (← links)
- Mining sequences with exceptional transition behaviour of varying order using quality measures based on information-theoretic scoring functions (Q832665) (← links)
- Horn axiomatizations for sequential data (Q870272) (← links)
- Mining approximate patterns with frequent locally optimal occurrences (Q906440) (← links)
- Mining sequential patterns across time sequences (Q951304) (← links)
- Fast discovery of sequential patterns in large databases using effective time-indexing (Q955236) (← links)
- PRISM: an effective approach for frequent sequence mining via prime-block encoding (Q1049280) (← links)
- Mining interesting patterns from uncertain databases (Q1615722) (← links)
- An efficient algorithm for hiding high utility sequential patterns (Q1642767) (← links)
- Memory-adaptive high utility sequential pattern mining over data streams (Q1699624) (← links)
- Mining time-constrained sequential patterns with constraint programming (Q1701240) (← links)
- Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining (Q1706775) (← links)
- Key-skeleton-pattern mining on 3D skeletons represented by Lie group for action recognition (Q1721448) (← links)
- Skopus: mining top-\(k\) sequential patterns under leverage (Q1741269) (← links)
- Mining local periodic patterns in a discrete sequence (Q2054105) (← links)
- Distance metric learning for graph structured data (Q2071320) (← links)
- Sequence graph transform (SGT): a feature embedding function for sequence data mining (Q2134047) (← links)
- SPEck: mining statistically-significant sequential patterns efficiently with exact sampling (Q2172635) (← links)
- Opportunistic mining of top-\(n\) high utility patterns (Q2198017) (← links)
- Efficient algorithms to identify periodic patterns in multiple sequences (Q2212579) (← links)
- Efficiently mining cohesion-based patterns and rules in event sequences (Q2218356) (← links)
- NegSPan: efficient extraction of negative sequential patterns with embedding constraints (Q2218420) (← links)
- A sequential tree approach for incremental sequential pattern mining (Q2360141) (← links)
- Mining frequent trajectory patterns in spatial-temporal databases (Q2390345) (← links)
- Model-lite planning: case-based vs. model-based approaches (Q2407874) (← links)
- Efficient strategies for tough aggregate constraint-based sequential pattern mining (Q2476781) (← links)
- A new approach for discovering fuzzy quantitative sequential patterns in sequence databases (Q2495467) (← links)
- Mining order-preserving submatrices from probabilistic matrices (Q2943568) (← links)
- Pushing multiple convertible constrains into frequent itemsets mining (Q3445988) (← links)
- Frequent Temporal Pattern Mining with Extended Lists (Q4556934) (← links)
- (Q4639985) (← links)
- Mining Compressing Sequential Patterns (Q4969924) (← links)
- Mining Clinical Process from Hospital Information System: A Granular Computing Approach (Q5025040) (← links)
- On Efficient Reinforcement Learning for Full-length Game of StarCraft II (Q5041016) (← links)
- Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates (Q5054978) (← links)
- (Q5852898) (← links)
