Tightness: A novel heuristic and a clustering mechanism to improve the interpretation of association rules

R. Natarajan, B. Shekar
{"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.
紧密性:一种新的启发式和聚类机制,以改进关联规则的解释
在本文中,我们提出了一种基于聚类的方法来缓解关联规则(AR)挖掘中的“规则无限性”和由此产生的“可理解性”问题。聚类“相似”规则有助于探索规则之间的联系,并发现潜在的结构。我们首先引入应收账款的“紧度”概念。它揭示了应收账款中各种项目之间的绑定强度。我们详细说明了它在零售市场篮子环境中的实用性,并在“紧度”的基础上开发了距离函数。该距离函数的使用通过使用平均链接方法对一个小的人工ar集进行聚类来说明。将由此获得的聚类与在同一数据集上运行标准方法(来自最近的数据挖掘文献)获得的聚类进行比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信