Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
An effective hash-based algorithm for mining association rules
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Mining optimized association rules for numeric attributes
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Beyond market baskets: generalizing association rules to correlations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A new framework for itemset generation
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query flocks: a generalization of association-rule mining
SIGMOD '98 Proceedings of the 1998 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
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Optimization of constrained frequent set queries with 2-variable constraints
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Pruning and summarizing the discovered associations
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining optimized gain rules for numeric attributes
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining the most interesting rules
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scalable Techniques for Mining Causal Structures
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Constructing Efficient Decision Trees by Using Optimized Numeric Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient Construction of Regression Trees with Range and Region Splitting
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
ACM SIGKDD Explorations Newsletter
Optimized Substructure Discovery for Semi-structured Data
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Discovering Best Variable-Length-Don't-Care Patterns
DS '02 Proceedings of the 5th International Conference on Discovery Science
Finding Best Patterns Practically
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
A Practical Algorithm to Find the Best Subsequence Patterns
DS '00 Proceedings of the Third International Conference on Discovery Science
Answering the Most Correlated N Association Rules Efficiently
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Computing Optimal Hypotheses Efficiently for Boosting
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
A practical algorithm to find the best subsequence patterns
Theoretical Computer Science
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
CoMine: Efficient Mining of Correlated Patterns
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Mining Significant Pairs of Patterns from Graph Structures with Class Labels
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Playing hide-and-seek with correlations
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
On the complexity of inducing categorical and quantitative association rules
Theoretical Computer Science
FARMER: finding interesting rule groups in microarray datasets
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Finding the most interesting correlations in a database: how hard can it be?
Information Systems
TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets
IEEE Transactions on Knowledge and Data Engineering
A model for association rules based on clustering
Proceedings of the 2005 ACM symposium on Applied computing
CTC — Correlating Tree Patterns for Classification
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Convolution kernels with feature selection for natural language processing tasks
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Entire regularization paths for graph data
Proceedings of the 24th international conference on Machine learning
Finding low-entropy sets and trees from binary data
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Mining significant graph patterns by leap search
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Partial least squares regression for graph mining
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Ensemble-Trees: Leveraging Ensemble Power Inside Decision Trees
DS '08 Proceedings of the 11th International Conference on Discovery Science
On Optimal Rule Mining: A Framework and a Necessary and Sufficient Condition of Antimonotonicity
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Models for association rules based on clustering and correlation
Intelligent Data Analysis
Mining constraint-based patterns using automatic relaxation
Intelligent Data Analysis
Large-scale graph mining using backbone refinement classes
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Correlated itemset mining in ROC space: a constraint programming approach
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Pruning Strategies Based on the Upper Bound of Information Gain for Discriminative Subgraph Mining
Knowledge Acquisition: Approaches, Algorithms and Applications
Cluster-grouping: from subgroup discovery to clustering
Machine Learning
Local query mining in a probabilistic prolog
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Output space sampling for graph patterns
Proceedings of the VLDB Endowment
Engineering Applications of Artificial Intelligence
Adverse drug reaction mining in pharmacovigilance data using formal concept analysis
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Fast, effective molecular feature mining by local optimization
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Mining class-correlated patterns for sequence labeling
DS'10 Proceedings of the 13th international conference on Discovery science
Itemset mining: A constraint programming perspective
Artificial Intelligence
Using constraints to generate and explore higher order discriminative patterns
PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part I
Direct local pattern sampling by efficient two-step random procedures
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Fast and memory-efficient discovery of the top-k relevant subgroups in a reduced candidate space
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I
Mining classification rules without support: an anti-monotone property of Jaccard measure
DS'11 Proceedings of the 14th international conference on Discovery science
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs
Journal of Intelligent Information Systems
Don't be afraid of simpler patterns
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Tree2: decision trees for tree structured data
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
An efficiently algorithm based on itemsets-lattice and bitmap index for finding frequent itemsets
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
MLDM'05 Proceedings of the 4th international conference on Machine Learning and Data Mining in Pattern Recognition
Relevancy in constraint-based subgroup discovery
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Inductive querying for discovering subgroups and clusters
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
An algorithm for mining implicit itemset pairs based on differences of correlations
DS'05 Proceedings of the 8th international conference on Discovery Science
Multi-class correlated pattern mining
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Secure Distributed Subgroup Discovery in Horizontally Partitioned Data
Transactions on Data Privacy
Linear space direct pattern sampling using coupling from the past
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
An enhanced relevance criterion for more concise supervised pattern discovery
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient Search Methods for Statistical Dependency Rules
Fundamenta Informaticae - Machine Learning in Bioinformatics
Optimonotone Measures For Optimal Rule Discovery
Computational Intelligence
| Hi-index | 0.00 |
We study how to efficiently compute significant association rules according to common statistical measures such as a chi-squared value or correlation coefficient. For this purpose, one might consider to use of the Apriori algorithm, but the algorithm needs major conversion, because none of these statistical metrics are anti-monotone, and the use of higher support for reducing the search space cannot guarantee solutions in its the search space. We here present a method of estimating a tight upper bound on the statistical metric associated with any superset of an itemset, as well as the novel use of the resulting information of upper bounds to prune unproductive supersets while traversing itemset lattices. Experimental tests demonstrate the efficiency of this method.