The role of least frequent item sets in association discovery

Rani J. Swargam, M. Palakal
{"title":"The role of least frequent item sets in association discovery","authors":"Rani J. Swargam, M. Palakal","doi":"10.1109/ICDIM.2007.4444226","DOIUrl":null,"url":null,"abstract":"Advances in commercial and scientific data collection have generated a flood of data which has triggered the need to turn such data into useful information and knowledge to identify novel, potentially useful patterns in data stored in databases. This work presents the development, implementation and application of an adaptive apriori algorithm for mining large datasets focusing on extracting interesting associations rules for less frequent item sets. The relevance of the adaptive apriori algorithm has been studied with respect to the set of data that was obtained by applying the transitive closure property among objects obtained from the biomedical scientific literature where both frequent and infrequent events need to be detected. Three adaptive apriori association rule mining methods, the weight induced apriori association rule mining (WIAARM), weight and significance induced apriori association rule mining (WSIAARM) and significance induced apriori association rule mining (SIAARM) are presented to effectively prune and extract meaningful association rules. These rules were applied on a large set of biological entity-entity association records and the results indicated that both WIAARM and WSIAARM were able to discover item sets with low and high frequency.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd International Conference on Digital Information Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDIM.2007.4444226","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Advances in commercial and scientific data collection have generated a flood of data which has triggered the need to turn such data into useful information and knowledge to identify novel, potentially useful patterns in data stored in databases. This work presents the development, implementation and application of an adaptive apriori algorithm for mining large datasets focusing on extracting interesting associations rules for less frequent item sets. The relevance of the adaptive apriori algorithm has been studied with respect to the set of data that was obtained by applying the transitive closure property among objects obtained from the biomedical scientific literature where both frequent and infrequent events need to be detected. Three adaptive apriori association rule mining methods, the weight induced apriori association rule mining (WIAARM), weight and significance induced apriori association rule mining (WSIAARM) and significance induced apriori association rule mining (SIAARM) are presented to effectively prune and extract meaningful association rules. These rules were applied on a large set of biological entity-entity association records and the results indicated that both WIAARM and WSIAARM were able to discover item sets with low and high frequency.
最不频繁项集在关联发现中的作用
商业和科学数据收集方面的进展产生了大量数据,因此需要将这些数据转化为有用的信息和知识,以确定存储在数据库中的数据中新颖的、可能有用的模式。这项工作提出了一种自适应先验算法的开发、实现和应用,用于挖掘大型数据集,重点是为不太频繁的项目集提取有趣的关联规则。研究了自适应先验算法的相关性,该算法通过应用生物医学科学文献中获得的对象之间的传递闭包属性获得数据集,其中需要检测频繁和不频繁的事件。提出了三种自适应先验关联规则挖掘方法:权重诱导先验关联规则挖掘(WIAARM)、权重和显著性诱导先验关联规则挖掘(WSIAARM)和显著性诱导先验关联规则挖掘(SIAARM),以有效地修剪和提取有意义的关联规则。将这些规则应用于大量的生物实体-实体关联记录,结果表明WIAARM和WSIAARM都能够发现低频率和高频率的项目集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信