Frequent ItemsetsAssociation rules and market basket ana.ppt

Frequent ItemsetsAssociation rules and market basket ana.ppt

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

Frequent Itemsets Association rules and market basket analysis CS240B--UCLA Notes by Carlo Zaniolo Most slides borrowed from Jiawei Han,UIUC Association Rules Correlations Basic concepts Efficient and scalable frequent itemset mining methods: Apriori, and improvements FP-growth Rule derivation, visualization and validation Multi-level Associations Temporal associations and frequent sequences Other association mining methods Summary Market Basket Analysis: the context Market Basket Analysis: the context Goal of MBA Extract information on purchasing behavior Actionable information: can suggest new store layouts new product assortments which products to put on promotion MBA applicable whenever a customer purchases multiple things in proximity credit cards services of telecommunication companies banking services medical treatments MBA: applicable to many other contexts Association Rules Express how product/services relate to each other, and tend to group together “if a customer purchases three-way calling, then will also purchase call-waiting” simple to understand actionable information: bundle three-way calling and call-waiting in a single package Frequent Itemsets Frequent Itemsets Example Itemset support Rules confidence Association Rules: Meaning Association Rules - Example For rule A ? C: support = support({A, C}) = 50% confidence = support({A, C})/support({A}) = 66.6% The Apriori principle: Any subset of a frequent itemset must be frequent Closed Patterns and Max-Patterns A long pattern contains very many subpatterns---combinatorial explosion Closed patterns and max-patterns An itemset is closed if none of its supersets has the same support Closed pattern is a lossless compression of freq. patterns--Reducing the # of patterns and rules An itemset is maximal frequent if none of its supersets is frequent But support of their subsets is not known – additional DB scans are needed Frequent Itemsets Maximal Frequent Itemset: if none of its supersets is

文档评论(0)

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

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

1亿VIP精品文档

相关文档