On generating all maximal independent sets
Information Processing Letters
Efficient algorithms for listing combinatorial structures
Efficient algorithms for listing combinatorial structures
Efficient mining of emerging patterns: discovering trends and differences
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Can we push more constraints into frequent pattern mining?
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
On frequent sets of Boolean matrices
Annals of Mathematics and Artificial Intelligence
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
DualMiner: A Dual-Pruning Algorithm for Itemsets with Constraints
Data Mining and Knowledge Discovery
ExAMiner: Optimized Level-wise Frequent Pattern Mining with Monotone Constraints
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
Data Mining and Knowledge Discovery
ExAnte: A Preprocessing Method for Frequent-Pattern Mining
IEEE Intelligent Systems
On the complexity of finding emerging patterns
Theoretical Computer Science - Pattern discovery in the post genome
Bifold Constraint-Based Mining by Simultaneous Monotone and Anti-Monotone Checking
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Computational aspects of mining maximal frequent patterns
Theoretical Computer Science
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
Optimal string mining under frequency constraints
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Pushing tougher constraints in frequent pattern mining
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
New exact concise representation of rare correlated patterns: application to intrusion detection
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
| Hi-index | 0.00 |
In this paper we rule out output polynomial listing algorithms for the general problem of discovering theories for a conjunction of monotone and anti-monotone constraints as well as for the particular subproblem in which all constraints are frequency-based. For the general problem we prove a concrete exponential lower time bound that holds for any correct algorithm and even in cases in which the size of the theory as well as the only previous bound are constant. For the case of frequency-based constraints our result holds unless P = NP. These findings motivate further research to identify tractable subproblems and justify approaches with exponential worst case complexity.