{"title":"Tightness: A novel heuristic and a clustering mechanism to improve the interpretation of association rules","authors":"R. Natarajan, B. Shekar","doi":"10.1109/IRI.2008.4583048","DOIUrl":null,"url":null,"abstract":"In this paper we present a clustering-based approach to mitigate the ‘rule immensity’ and the resulting ‘understandability’ problem in association rule (AR) mining. Clustering ‘similar’ rules facilitates exploration of connections among rules and the discovery of underlying structures. We first introduce the notion of ‘tightness’ of an AR. It reveals the strength of binding between various items present in an AR. We elaborate on its usefulness in the retail market-basket context and develop a distance-function on the basis of ‘tightness.’ Usage of this distance function is exemplified by clustering a small artificial set of ARs with the help of average-linkage method. Clusters thus obtained are compared with those obtained by running a standard method (from recent data mining literature) on the same data set.","PeriodicalId":169554,"journal":{"name":"2008 IEEE International Conference on Information Reuse and Integration","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE International Conference on Information Reuse and Integration","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRI.2008.4583048","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In this paper we present a clustering-based approach to mitigate the ‘rule immensity’ and the resulting ‘understandability’ problem in association rule (AR) mining. Clustering ‘similar’ rules facilitates exploration of connections among rules and the discovery of underlying structures. We first introduce the notion of ‘tightness’ of an AR. It reveals the strength of binding between various items present in an AR. We elaborate on its usefulness in the retail market-basket context and develop a distance-function on the basis of ‘tightness.’ Usage of this distance function is exemplified by clustering a small artificial set of ARs with the help of average-linkage method. Clusters thus obtained are compared with those obtained by running a standard method (from recent data mining literature) on the same data set.