SPADE: An efficient algorithm for mining frequent sequences
From MaRDI portal
Publication:5928969
DOI10.1023/A:1007652502315zbMath0970.68052MaRDI QIDQ5928969
Publication date: 17 April 2001
Published in: Machine Learning (Search for Journal in Brave)
68P15: Database theory
Related Items
Structured Hidden Markov Models: A General Tool for Modeling Agent Behaviors, MINING FREQUENT TEMPORAL PATTERNS IN INTERVAL SEQUENCES, SPADE, e-NSP: efficient negative sequential pattern mining, Horn axiomatizations for sequential data, A fast method for discovering critical edge sequences in e-commerce catalogs, Triadic formal concept analysis and triclustering: searching for optimal patterns, Mining approximate patterns with frequent locally optimal occurrences, Applying sequential rules to protein localization prediction, Mining sequential patterns across time sequences, Fast discovery of sequential patterns in large databases using effective time-indexing, PRISM: an effective approach for frequent sequence mining via prime-block encoding, Mining probabilistic automata: a statistical view of sequential pattern mining, Finding sequential patterns with TF-IDF metrics in health-care databases, Mining frequent trajectory patterns in spatial-temporal databases, Efficient strategies for tough aggregate constraint-based sequential pattern mining, Frequency-based views to pattern collections, A new approach for discovering fuzzy quantitative sequential patterns in sequence databases, Computational aspects of mining maximal frequent patterns, On mining complex sequential data by means of FCA and pattern structures, COMPARISON OF INTERESTINGNESS MEASURES FOR WEB USAGE MINING: AN EMPIRICAL STUDY, DISCOVERING IMPORTANT SEQUENTIAL PATTERNS WITH LENGTH-DECREASING WEIGHTED SUPPORT CONSTRAINTS, DISCOVERING FUZZY UNEXPECTED SEQUENCES WITH CONCEPT HIERARCHIES
Uses Software
