Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Can we push more constraints into frequent pattern mining?
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Molecular feature mining in HIV data
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A Theory of Inductive Query Answering
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Efficient Mining of Constrained Correlated Sets
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
ExAMiner: Optimized Level-wise Frequent Pattern Mining with Monotone Constraints
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
An Algebra for Inductive Query Evaluation
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Linear pattern matching algorithms
SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
The levelwise version space algorithm and its application to molecular fragment finding
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Fast Frequent String Mining Using Suffix Arrays
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Looking for monotonicity properties of a similarity constraint on sequences
Proceedings of the 2006 ACM symposium on Applied computing
Efficient String Mining under Constraints Via the Deferred Frequency Index
ICDM '08 Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects
Introducing Softness into Inductive Queries on String Databases
Proceedings of the 2007 conference on Databases and Information Systems IV: Selected Papers from the Seventh International Baltic Conference DB&IS'2006
Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
Fundamenta Informaticae - Special Issue on Stringology
Analysis of time series data with predictive clustering trees
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
Optimal string mining under frequency constraints
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences
Fundamenta Informaticae - Special Issue on Stringology
| Hi-index | 0.00 |
We study the problem of mining substring patterns from string databases. Patterns are selected using a conjunction of monotonic and anti-monotonic predicates. Based on the earlier introduced version space tree data structure, a novel algorithm for discovering substring patterns is introduced. It has the nice property of requiring only one database scan, which makes it highly scalable and applicable in distributed environments, where the data are not necessarily stored in local memory or disk. The algorithm is experimentally compared to a previously introduced algorithm in the same setting.