Logo image
Cubegrades: Generalizing Association Rules
Technical documentation   Open access

Cubegrades: Generalizing Association Rules

Tomasz Imieliński, Leonid Khachiyan and Amin Abdulghani
Rutgers University
1999
DOI:
https://doi.org/10.7282/T3DJ5K99

Abstract

Cubegrades are a generalization of association rules which represent how a set of measures (aggregates) is affected by modifying a cube through specialization (roll down), generalization (rollup) and mutation (which is a change in one of the cube’s dimensions). Cubegrades are significantly more expressive than association rules in capturing trends and patterns in data because they use arbitrary aggregate measures, not just COUNT, as association rules do. Cubegrades are atoms which can support sophisticated “what if” analysis tasks dealing with the behavior of arbitrary aggregates over different database segments. As such, cubegrades can be useful in marketing, sales analysis, and other typical data mining applications in business. We formally define cubegrades, show methods to generate them by using efficient pruning algorithms and finally define two query languages to generate and retrieve sets of cubegrades which satisfy user-defined conditions. We also demonstrate how to evaluate simple cubegrade queries and conclude with a number of open questions and possible extensions of the work.
pdf
dcs-tr-396257.86 kBDownloadView
Version of Record (VoR) Open Access
url
Report an accessibility issueView
Please complete a content remediation request to report an accessibility issue with a library electronic resource, website, or service.

Metrics

182 File downloads
87 Record Views

Details

Logo image