Demonstration: A Prototype for the Exploratory Mining of Constrained Association Rules
Raymond T. Ng, Laks V.S. Lakshmanan, Jaiwei Han, Teresa Mah
SIGMOD 99, June 2, 1999
Welcome to a demonstration of our CAP prototype. The CAP prototype demonstrates a new
exploratory model of association mining where the mining process is split up into two phases.
In Phase I, users specify constraints on the data to be mined. In Phase II, users can manually
select only those candidate pairs that are interesting enough to find relationships on, and proceed
to select from three different relationship metrics to assess candidate association.
More detailed information regarding the exploratory model, the CAP algorithm, and this demonstration
can be found in the handout given at SIGMOD 99.
The following lists the demo screens in the order that they should be viewed. Note: This demonstration is best viewed with a resolution of 1024 x 768.
Introduction to the Demonstration
- CAP - Getting Started
- Opening a Database File
- Viewing the Metadata
- Viewing the Relation
- The Main Window
- Creating Antecedent Constraints
- Antecedent Class Constraint
- Antecedent Frequency Constraint
- Antecedent Domain Constraint
- Creating Consequent Constraints
- Consequent Class Constraint
- Consequent Frequency Constraint
- Consequent Aggregate Constraint
- Two-Variable Constraints
- Running CAP
- One-Variable Frequent Sets
- Two-Variable Candidate Pairs
- Sorting Frequent Sets
- Chart of Sorted Candidate Sets
- Sorted Frequent Sets
- Candidate Set Selection Mode
- The Selection Helper
- Specifying the Relationship Metric and Significance Threshold
- Related Sets
- Reiterating Through Phase II
- Dependent Sets
Conclusion