Association Rule Pruning based on Interestingness Measures with Clustering
S.Kannan, R.Bhaskaran

TL;DR
This paper explores how association rule clusters are distributed across various interestingness measures, aiming to improve rule pruning and grouping in knowledge mining.
Contribution
It introduces an analysis of rule clusters based on interestingness measures, enhancing understanding of rule distribution for better pruning strategies.
Findings
Rule clusters vary significantly across different interestingness measures.
Clustering helps identify more meaningful rules for knowledge discovery.
The study provides insights into effective rule pruning techniques.
Abstract
Association rule mining plays vital part in knowledge mining. The difficult task is discovering knowledge or useful rules from the large number of rules generated for reduced support. For pruning or grouping rules, several techniques are used such as rule structure cover methods, informative cover methods, rule clustering, etc. Another way of selecting association rules is based on interestingness measures such as support, confidence, correlation, and so on. In this paper, we study how rule clusters of the pattern Xi - Y are distributed over different interestingness measures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Mining Algorithms and Applications · Rough Sets and Fuzzy Logic · Data Management and Algorithms
