An Effective Clustering-based Approach for Conceptual Association Rules Mining

T. Quan, Linh N. Ngo, S. Hui
{"title":"An Effective Clustering-based Approach for Conceptual Association Rules Mining","authors":"T. Quan, Linh N. Ngo, S. Hui","doi":"10.1109/RIVF.2009.5174619","DOIUrl":null,"url":null,"abstract":"Association rule mining is a well-known data mining task for discovering association rules between items in a dataset. It has been successfully applied to different domains especially for business applications. However, the mined rules rely heavily on human interpretation in order to infer their semantic meanings. In this paper, we mine a new kind of association rules, called conceptual association rules, which imply the relationships between concepts. Conceptual association rules can convey more semantic meanings than those classical association rules. Conceptual association rules can be mined using Formal Concept Analysis (FCA). However, the FCA-based method for conceptual rule mining suffers from high computational cost when dealing with large datasets. To tackle this problem, we propose a cluster-based approach to mine conceptual association rules regionally, rather than globally. A distance metric is also proposed to ensure that the same rule sets will ultimately be obtained when the dataset is clustered. In this paper, we present the proposed clustering-based approach. In addition, the proposed approach has been evaluated with four benchmarking datasets and promising results have been achieved.","PeriodicalId":243397,"journal":{"name":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE-RIVF International Conference on Computing and Communication Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2009.5174619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Association rule mining is a well-known data mining task for discovering association rules between items in a dataset. It has been successfully applied to different domains especially for business applications. However, the mined rules rely heavily on human interpretation in order to infer their semantic meanings. In this paper, we mine a new kind of association rules, called conceptual association rules, which imply the relationships between concepts. Conceptual association rules can convey more semantic meanings than those classical association rules. Conceptual association rules can be mined using Formal Concept Analysis (FCA). However, the FCA-based method for conceptual rule mining suffers from high computational cost when dealing with large datasets. To tackle this problem, we propose a cluster-based approach to mine conceptual association rules regionally, rather than globally. A distance metric is also proposed to ensure that the same rule sets will ultimately be obtained when the dataset is clustered. In this paper, we present the proposed clustering-based approach. In addition, the proposed approach has been evaluated with four benchmarking datasets and promising results have been achieved.
一种基于聚类的概念关联规则挖掘方法
关联规则挖掘是一项众所周知的数据挖掘任务,用于发现数据集中项之间的关联规则。它已经成功地应用于不同的领域,特别是商业应用程序。然而,挖掘的规则在很大程度上依赖于人类的解释来推断它们的语义。在本文中,我们挖掘了一种新的关联规则,即概念关联规则,它暗示了概念之间的关系。概念关联规则比经典关联规则能传递更多的语义。概念关联规则可以使用形式概念分析(FCA)来挖掘。然而,基于fca的概念规则挖掘方法在处理大型数据集时存在计算成本高的问题。为了解决这个问题,我们提出了一种基于聚类的方法来挖掘区域的概念关联规则,而不是全局的。还提出了距离度量,以确保在数据集聚类时最终获得相同的规则集。在本文中,我们提出了基于聚类的方法。此外,所提出的方法已经用四个基准数据集进行了评估,并取得了令人满意的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信