Optimization of constrained frequent set queries with 2-variable constraints
- 1 June 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 28 (2) , 157-168
- https://doi.org/10.1145/304182.304196
Abstract
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.Keywords
This publication has 13 references indexed in Scilit:
- Efficiently mining long patterns from databasesPublished by Association for Computing Machinery (ACM) ,1998
- Integrating association rule mining with relational database systemsPublished by Association for Computing Machinery (ACM) ,1998
- Exploratory mining and pruning optimizations of constrained associations rulesPublished by Association for Computing Machinery (ACM) ,1998
- Query flocksPublished by Association for Computing Machinery (ACM) ,1998
- Database systems—breaking out of the boxACM SIGMOD Record, 1997
- A database perspective on knowledge discoveryCommunications of the ACM, 1996
- Data mining using two-dimensional optimized association rulesPublished by Association for Computing Machinery (ACM) ,1996
- Mining quantitative association rules in large relational tablesPublished by Association for Computing Machinery (ACM) ,1996
- An effective hash-based algorithm for mining association rulesPublished by Association for Computing Machinery (ACM) ,1995
- Mining association rules between sets of items in large databasesPublished by Association for Computing Machinery (ACM) ,1993