关联规则挖掘AssociationRuleMining背景简介Motivation超购物.PPT

关联规则挖掘AssociationRuleMining背景简介Motivation超购物.PPT

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
关联规则挖掘AssociationRuleMining背景简介Motivation超购物

Interestingness via Unexpectedness Need to model expectation of users (domain knowledge) Need to combine expectation of users with evidence from data (i.e., extracted patterns) + Pattern expected to be frequent - Pattern expected to be infrequent Pattern found to be frequent Pattern found to be infrequent + - Expected Patterns - + Unexpected Patterns Interestingness via Unexpectedness Web Data Domain knowledge in the form of site structure Given an itemset F = {X1, X2, …, Xk} (Xi : Web pages) L: number of links connecting the pages lfactor = L / (k ? k-1) cfactor = 1 (if graph is connected), 0 (disconnected graph) Structure evidence = cfactor ? lfactor Usage evidence Use Dempster-Shafer theory to combine domain knowledge and evidence from data P250 2、3、4、9、11 wm Immediate紧接的 Contingency table 列联表 Rule Generation for Apriori Algorithm Candidate rule is generated by merging two rules that share the same prefix in the rule consequent join(CD=AB,BD=AC) would produce the candidate rule D = ABC Prune rule D=ABC if its subset AD=BC does not have high confidence Effect of Support Distribution Many real data sets have skewed support distribution Support distribution of a retail data set Effect of Support Distribution How to set the appropriate minsup threshold? If minsup is set too high, we could miss itemsets involving interesting rare items (e.g., expensive products) If minsup is set too low, it is computationally expensive and the number of itemsets is very large Using a single minimum support threshold may not be effective Multiple Minimum Support How to apply multiple minimum supports? MS(i): minimum support for item i e.g.: MS(Milk)=5%, MS(Coke) = 3%, MS(Broccoli)=0.1%, MS(Salmon)=0.5% MS({Milk, Broccoli}) = min (MS(Milk), MS(Broccoli)) = 0.1% Challenge: Support is no longer anti-monotone Suppose: Support(Milk, Coke) = 1.5% and Support(Milk, Coke, Broccoli) = 0.5% {Milk,Coke} is infrequent but {Mil

文档评论(0)

fengruiling + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档