Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Finding interesting rules from large sets of discovered association rules
CIKM '94 Proceedings of the third international conference on Information and knowledge management
An effective hash-based algorithm for mining association rules
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Mining quantitative association rules in large relational tables
SIGMOD '96 Proceedings of the 1996 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
A database perspective on knowledge discovery
Communications of the ACM
Beyond market baskets: generalizing association rules to correlations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Association rules over interval data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Database systems—breaking out of the box
ACM SIGMOD Record
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
Integrating association rule mining with relational database systems: alternatives and implications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Ratio Rules: A New Paradigm for Fast, Quantifiable Data Mining
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Scalable Techniques for Mining Causal Structures
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
On the Discovery of Interesting Patterns in Association Rules
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
Discovery of Multiple-Level Association Rules from Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Mining Generalized Association Rules
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Breaking the barrier of transactions: mining inter-transaction association rules
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Transversing itemset lattices with statistical metric pruning
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Depth first generation of long patterns
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Exploring constraints to efficiently mine emerging patterns from large high-dimensional datasets
Proceedings of the sixth 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
Efficient computation of Iceberg cubes with complex measures
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Mining frequent patterns by pattern-growth: methodology and implications
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
The segment support map: scalable mining of frequent itemsets
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
Sliding-window filtering: an efficient algorithm for incremental mining
Proceedings of the tenth international conference on Information and knowledge management
Scalable frequent-pattern mining methods: an overview
Tutorial notes of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Constrained frequent pattern mining: a pattern-growth view
ACM SIGKDD Explorations Newsletter
Exploiting succinct constraints using FP-trees
ACM SIGKDD Explorations Newsletter
Cubegrades: Generalizing Association Rules
Data Mining and Knowledge Discovery
Axiomatization of frequent itemsets
Theoretical Computer Science
Efficient Mining of Intertransaction Association Rules
IEEE Transactions on Knowledge and Data Engineering
Alternative Interest Measures for Mining Associations in Databases
IEEE Transactions on Knowledge and Data Engineering
Incremental Mining of Constrained Associations
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Constraint-based clustering in large databases
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Axiomatization of Frequent Sets
ICDT '01 Proceedings of the 8th International Conference on Database Theory
The 3W Model and Algebra for Unified Data Mining
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
On Supporting Interactive Association Rule Mining
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Data Mining of Association Rules and the Process of Knowledge Discovery in Databases
Industrial Conference on Data Mining: Advances in Data Mining, Applications in E-Commerce, Medicine, and Knowledge Management
On Monotone Data Mining Languages
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
A template model for multidimensional inter-transactional association rules
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Distributed data mining in a chain store database of short transactions
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficiently computing the top N averages in iceberg cubes
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Tough constraint-based frequent closed itemsets mining
Proceedings of the 2003 ACM symposium on Applied computing
Optimization of a language for data mining
Proceedings of the 2003 ACM symposium on Applied computing
Efficient dynamic mining of constrained frequent sets
ACM Transactions on Database Systems (TODS)
Pushing Convertible Constraints in Frequent Itemset Mining
Data Mining and Knowledge Discovery
ExAnte: A Preprocessing Method for Frequent-Pattern Mining
IEEE Intelligent Systems
Mining condensed frequent-pattern bases
Knowledge and 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
A framework to support multiple query optimization for complex mining tasks
MDM '05 Proceedings of the 6th international workshop on Multimedia data mining: mining integrated media and complex data
On condensed representations of constrained frequent patterns
Knowledge and Information Systems
Constraining and summarizing association rules in medical data
Knowledge and Information Systems
Parallel Bifold: Large-scale parallel pattern mining with constraints
Distributed and Parallel Databases
Extending the state-of-the-art of constraint-based pattern discovery
Data & Knowledge Engineering
Soft constraint based pattern mining
Data & Knowledge Engineering
Twain: Two-end association miner with precise frequent exhibition periods
ACM Transactions on Knowledge Discovery from Data (TKDD)
Optimization of association rule mining queries
Intelligent Data Analysis
Cost-based query optimization for complex pattern mining on multiple databases
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
A method for mining quantitative association rules
SMO'06 Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization
Efficient algorithms for incremental Web log mining with dynamic thresholds
The VLDB Journal — The International Journal on Very Large Data Bases
A data mining proxy approach for efficient frequent itemset mining
The VLDB Journal — The International Journal on Very Large Data Bases
INCREMENTAL EXTRACTION OF ASSOCIATION RULES IN APPLICATIVE DOMAINS
Applied Artificial Intelligence
Discovering data quality rules
Proceedings of the VLDB Endowment
A constraint-based querying system for exploratory pattern discovery
Information Systems
TCOM, an innovative data structure for mining association rules among infrequent items
Computers & Mathematics with Applications
Deriving strong association mining rules using a dependency criterion, the lift measure
International Journal of Data Analysis Techniques and Strategies
On pushing weight constraints deeply into frequent itemset mining
Intelligent Data Analysis
Progressive weighted miner: an efficient method for time-constraint mining
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
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
Association rule mining: models and algorithms
Association rule mining: models and algorithms
Mining partially labeled subgraphs using support constraints
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2
Mining interesting XML-enabled association rules with templates
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Optimization of association rules extraction through exploitation of context dependent constraints
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
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
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 novel incremental approach to association rules mining in inductive databases
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Flexible online association rule mining based on multidimensional pattern relations
Information Sciences: an International Journal
A constraint language for declarative pattern discovery
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Currently, there is tremendous interest in providing ad-hoc mining capabilities in database management systems. As a first step towards this goal, in [15] we proposed an architecture for supporting constraint-based, human-centered, exploratory mining of various kinds of rules including associations, introduced the notion of constrained frequent set queries (CFQs), and developed effective pruning optimizations for CFQs with 1-variable (1-var) constraints.While 1-var constraints are useful for constraining the antecedent and consequent separately, many natural examples of CFQs illustrate the need for constraining the antecedent and consequent jointly, for which 2-variable (2-var) constraints are indispensable. Developing pruning optimizations for CFQs with 2-var constraints is the subject of this paper. But this is a difficult problem because: (i) in 2-var constraints, both variables keep changing and, unlike 1-var constraints, there is no fixed target for pruning; (ii) as we show, “conventional” monotonicity-based optimization techniques do not apply effectively to 2-var constraints.The contributions are as follows. (1) We introduce a notion of quasi-succinctness, which allows a quasi-succinct 2-var constraint to be reduced to two succinct 1-var constraints for pruning. (2) We characterize the class of 2-var constraints that are quasi-succinct. (3) We develop heuristic techniques for non-quasi-succinct constraints. Experimental results show the effectiveness of all our techniques. (4) We propose a query optimizer for CFQs and show that for a large class of constraints, the computation strategy generated by the optimizer is ccc-optimal, i.e., minimizing the effort incurred w.r.t. constraint checking and support counting.