TY - GEN
T1 - Exploratory Mining via Constrained Frequent Set Queries
AU - Ng, Raymond
AU - Lakshmanan, Laks V.S.
AU - Han, Jiawei
AU - Mah, Teresa
N1 - Publisher Copyright:
© 1999 ACM.
PY - 1999/6/1
Y1 - 1999/6/1
N2 - Although there have been many studies on data mining, to date there have been few research prototypes or commercial systems supporting comprehensive query-driven mining, which encourages interactive exploration of the data. Our thesis is that constraint constructs and the optimization they induce play a pivotal role in mining queries, thus substantially enhancing the usefulness and performance of the mining system. This is based on the analogy of declarative query languages like SQL and query optimization which have made relational databases so successful. To this end, our proposed demo is not yet another data mining system, but of a new paradigm in data mining - mining with constraints, as the important first step towards supporting ad-hoc mining in DBMS.In this demo, we will show a prototype exploratory mining system that implements constraint-based mining query optimization methods proposed in [5]. We will demonstrate how a user can interact with the system for exploratory data mining and how efficiently the system may execute optimized data mining queries. The prototype system will include all the constraint pushing techniques for mining association rules outlined in [5], and will include additional capabilities for mining other kinds of rules for which the computation of constrained frequent sets forms the core first step.
AB - Although there have been many studies on data mining, to date there have been few research prototypes or commercial systems supporting comprehensive query-driven mining, which encourages interactive exploration of the data. Our thesis is that constraint constructs and the optimization they induce play a pivotal role in mining queries, thus substantially enhancing the usefulness and performance of the mining system. This is based on the analogy of declarative query languages like SQL and query optimization which have made relational databases so successful. To this end, our proposed demo is not yet another data mining system, but of a new paradigm in data mining - mining with constraints, as the important first step towards supporting ad-hoc mining in DBMS.In this demo, we will show a prototype exploratory mining system that implements constraint-based mining query optimization methods proposed in [5]. We will demonstrate how a user can interact with the system for exploratory data mining and how efficiently the system may execute optimized data mining queries. The prototype system will include all the constraint pushing techniques for mining association rules outlined in [5], and will include additional capabilities for mining other kinds of rules for which the computation of constrained frequent sets forms the core first step.
UR - http://www.scopus.com/inward/record.url?scp=85054324715&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85054324715&partnerID=8YFLogxK
U2 - 10.1145/304182.304575
DO - 10.1145/304182.304575
M3 - Conference contribution
AN - SCOPUS:85054324715
T3 - Proceedings of the ACM SIGMOD International Conference on Management of Data
SP - 556
EP - 558
BT - SIGMOD/PODS 1999 - Proceedings of the 1999 ACM SIGMOD International Conference on Management of Data and Symposium on Principles of Database Systems
PB - Association for Computing Machinery
T2 - 1999 ACM SIGMOD International Conference on Management of Data and Symposium on Principles of Database Systems, SIGMOD/PODS 1999
Y2 - 31 May 1999 through 3 June 1999
ER -