Strongest Association Rules Mining for Personalized Recommendation

Jie LI , Yong XU , Yun-feng WANG , Chao-hsien CHU
{"title":"Strongest Association Rules Mining for Personalized Recommendation","authors":"Jie LI ,&nbsp;Yong XU ,&nbsp;Yun-feng WANG ,&nbsp;Chao-hsien CHU","doi":"10.1016/S1874-8651(10)60064-6","DOIUrl":null,"url":null,"abstract":"<div><p>The article proposed the notion of strongest association rules (SAR), developed a matrix-based algorithm for mining SAR set. As the subset of the whole association rule set, SAR set includes much less rules with the special suitable form for personalized recommendation without information loss. With the SAR set mining algorithm, the transaction database is only scanned for once, the matrix scale becomes smaller and smaller, so that the mining efficiency is improved. Experiments with three data sets show that the number of rules in SAR set in average is only 26.2 percent of the total number of whole association rules, which mitigates the explosion of association rules.</p></div>","PeriodicalId":101206,"journal":{"name":"Systems Engineering - Theory & Practice","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1874-8651(10)60064-6","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems Engineering - Theory & Practice","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1874865110600646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

Abstract

The article proposed the notion of strongest association rules (SAR), developed a matrix-based algorithm for mining SAR set. As the subset of the whole association rule set, SAR set includes much less rules with the special suitable form for personalized recommendation without information loss. With the SAR set mining algorithm, the transaction database is only scanned for once, the matrix scale becomes smaller and smaller, so that the mining efficiency is improved. Experiments with three data sets show that the number of rules in SAR set in average is only 26.2 percent of the total number of whole association rules, which mitigates the explosion of association rules.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
个性化推荐的最强关联规则挖掘
提出了最强关联规则(SAR)的概念,提出了一种基于矩阵的SAR集挖掘算法。SAR集作为整个关联规则集的子集,包含的规则少得多,且具有适合个性化推荐的特殊形式,且没有信息丢失。采用SAR集挖掘算法,事务数据库只需扫描一次,矩阵规模越来越小,从而提高了挖掘效率。在三个数据集上的实验表明,SAR集的规则数平均仅占整个关联规则总数的26.2%,减轻了关联规则爆炸的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Information technology and systems Book review editorial Book review editorial A combined forecasting method integrating contextual knowledge Personal Credit Risk Measurement: Bilateral Antibody Artificial Immune Probability Model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1