SPADE: An efficient algorithm for mining frequent sequences
From MaRDI portal
Publication:5928969
DOI10.1023/A:1007652502315zbMath0970.68052OpenAlexW1608194207MaRDI QIDQ5928969
Publication date: 17 April 2001
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1007652502315
Related Items
A sequential tree approach for incremental sequential pattern mining, Mining interesting patterns from uncertain databases, e-NSP: efficient negative sequential pattern mining, Sequence graph transform (SGT): a feature embedding function for sequence data mining, Structured Hidden Markov Models: A General Tool for Modeling Agent Behaviors, Frequent Temporal Pattern Mining with Extended Lists, Mining frequent trajectory patterns in spatial-temporal databases, Horn axiomatizations for sequential data, An efficient algorithm for attribute-based subsequence matching, A fast method for discovering critical edge sequences in e-commerce catalogs, Uncovering Characteristic Response Paths of a Population, Model-lite planning: case-based vs. model-based approaches, Triadic formal concept analysis and triclustering: searching for optimal patterns, \texttt{TIRPCLo}: efficient and complete mining of time intervals-related patterns, COMPARISON OF INTERESTINGNESS MEASURES FOR WEB USAGE MINING: AN EMPIRICAL STUDY, Efficient algorithms for mining frequent high utility sequences with constraints, Mining high-utility sequences with positive and negative values, Memory-adaptive high utility sequential pattern mining over data streams, Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches, Mining approximate patterns with frequent locally optimal occurrences, Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining, Mining probabilistic automata: a statistical view of sequential pattern mining, Efficiently mining cohesion-based patterns and rules in event sequences, NegSPan: efficient extraction of negative sequential patterns with embedding constraints, Key-skeleton-pattern mining on 3D skeletons represented by Lie group for action recognition, 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, Efficient strategies for tough aggregate constraint-based sequential pattern mining, Finding sequential patterns with TF-IDF metrics in health-care databases, DISCOVERING IMPORTANT SEQUENTIAL PATTERNS WITH LENGTH-DECREASING WEIGHTED SUPPORT CONSTRAINTS, 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, A closed sets based learning classifier for implicit authentication in web browsing, System description: lang-n-change -- a tool for transforming languages, Interactive knowledge discovery from hidden data through sampling of frequent patterns, On mining complex sequential data by means of FCA and pattern structures, SPADE, DISCOVERING FUZZY UNEXPECTED SEQUENCES WITH CONCEPT HIERARCHIES, Checking Sets of Pure Evolving Association Rules, PRISM: an effective approach for frequent sequence mining via prime-block encoding, MINING FREQUENT TEMPORAL PATTERNS IN INTERVAL SEQUENCES, Unnamed Item
Uses Software
