An effective hash-based algorithm for mining association rules
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Exploratory mining and pruning optimizations of constrained associations rules
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Real world performance of association rule algorithms
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Mining Frequent Item Sets with Convertible Constraints
Proceedings of the 17th International Conference on Data Engineering
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
DualMiner: a dual-pruning algorithm for itemsets with constraints
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Adaptive and Resource-Aware Mining of Frequent Sets
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Optimization of association rule mining queries
Intelligent Data Analysis
ExAnte: A Preprocessing Method for Frequent-Pattern Mining
IEEE Intelligent Systems
Extracting spatial association rules from spatial transactions
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Bifold Constraint-Based Mining by Simultaneous Monotone and Anti-Monotone Checking
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
On condensed representations of constrained frequent patterns
Knowledge and Information Systems
Mining frequent geographic patterns with knowledge constraints
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Extending the state-of-the-art of constraint-based pattern discovery
Data & Knowledge Engineering
Soft constraint based pattern mining
Data & Knowledge Engineering
Discovering leaders from community actions
Proceedings of the 17th ACM conference on Information and knowledge management
A constraint-based querying system for exploratory pattern discovery
Information Systems
On the Complexity of Constraint-Based Theory Extraction
DS '09 Proceedings of the 12th International Conference on Discovery Science
On interactive pattern mining from relational databases
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
Constraint-based mining of web page associations
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
MCFPTree: An FP-tree-based algorithm for multi-constraint patterns discovery
International Journal of Business Intelligence and Data Mining
An efficient algorithm for mining string databases under constraints
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Interestingness is not a dichotomy: introducing softness in constrained pattern mining
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Pushing constraints to detect local patterns
LPD'04 Proceedings of the 2004 international conference on Local Pattern Detection
Local pattern discovery in Array-CGH data
LPD'04 Proceedings of the 2004 international conference on Local Pattern Detection
Pushing tougher constraints in frequent pattern mining
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A relational query primitive for constraint-based pattern mining
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
A unified approach for discovery of interesting association rules in medical databases
ICDM'06 Proceedings of the 6th Industrial Conference on Data Mining conference on Advances in Data Mining: applications in Medicine, Web Mining, Marketing, Image and Signal Mining
Mining databases and data streams with query languages and rules
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Memory-aware frequent k-itemset mining
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
An efficient method for mining frequent itemsets with double constraints
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
The key point of this paper is that, in frequent patternmining, the most appropriate way of exploiting monotoneconstraints in conjunction with frequency is to use them inorder to reduce the problem input together with the searchspace. Following this intuition, we introduce ExAMiner, alevel-wise algorithm which exploits the real synergy of anti-monotoneand monotone constraints: the total benefit isgreater than the sum of the two individual benefits. ExAMinergeneralizes the basic idea of the preprocessing algorithmExAnte, embedding such ideas at all levels ofan Apriori-like computation. The resulting algorithm is thegeneralization of the Apriori algorithm when a conjunctionof monotone constraints is conjoined to the frequency anti-monotoneconstraint. Experimental results confirm that thisis, so far, the most efficient way of attacking the computationalproblem in analysis.