Mining maximal flexible patterns in a sequence

Authors:
Hiroki Arimura;Takeaki Uno
Affiliations:
Graduate School of Information Science and Technology, Hokkaido University, Sapporo, Japan;National Institute of Informatics, Tokyo, Japan
Venue:
JSAI'07 Proceedings of the 2007 conference on New frontiers in artificial intelligence
Year:
2007

Citing 8
Cited 4

Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Algorithmic Program DeBugging

Algorithmic Program DeBugging
Discovery of Frequent Episodes in Event Sequences

Data Mining and Knowledge Discovery
Polynomial Time Inference of Extended Regular Pattern Languages

Proceedings of RIMS Symposium on Software Science and Engineering
Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data

STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
BIDE: Efficient Mining of Frequent Closed Sequences

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Efficient serial episode mining with minimal occurrences

Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Efficient algorithms for mining frequent and closed patterns from semi-structured data

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
MADMX: a novel strategy for maximal dense motif extraction

WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
General algorithms for mining closed flexible patterns under various equivalence relations

ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of enumerating all maximal flexible patterns in an input sequence database for the class of flexible patterns, where a maximal pattern (also called a closed pattern) is the most specific pattern among the equivalence class of patterns having the same list of occurrences in the input. Since our notion of maximal patterns is based on position occurrences, it is weaker than the traditional notion of maximal patterns based on document occurrences. Based on the framework of reverse search, we present an efficient depth-first search algorithm MaxFlex for enumerating all maximal flexible patterns in a given sequence database without duplicates in O(||T||×|σ|) time per pattern and O(||T||) space, where ||T|| is the size of the input sequence database T and |σ| is the size of the alphabet on which the sequences are defined. This means that the enumeration problem for maximal flexible patterns is shown to be solvable in polynomial delay and polynomial space.