- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
第6章-DM-Association rule
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * HD-ITR * Constraint-based association mining Metarule-guided association mining Metarules allow users to specify the syntactic form of rules that they are interested in mining Example, a metarule P1(X, Y) ∧P2(X, W) ? buys(X, “educational software”) can be matched by age(X, “35-45”) ∧income(X, “40-60K”) ? buys(X, “educational software”) 7.3.4 Constraint-based Data Mining * HD-ITR * Summary Basic concepts Apriori algorithm Improving the efficiency of Apriori FP-growth Other association rule mining Multilevel association rule Multidimensional association rule Correlation analysis Constraint-based Data Mining Chapter 7 Mining Association Rules * HD-ITR * Thank you !!! * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * HD-ITR * Multilevel association rule A top-down, progressive deepening approach: Find high-level strong rules e.g. buys(X, “computer”) ? buys(X, “printer”) [20%, 60%] Then find their lower-level “weaker”rules e.g. buys(X, “IBM computer”) ? buys(X, “HP printer”) [6%, 50%] 7.3.1 Mining Multilevel association rule * HD-ITR * Multilevel association rule A number of variations: Using uniform minimum support for all levels(uniform support): 7.3.1 Mining Multilevel association rule * HD-ITR * Multilevel association rule A number of variations: Using reduced minimum support at lower levels(reduced support): 7.3.1 Mining Multilevel association rule * HD-ITR * Multilevel association rule A number of variations: For mining multiple-level associations with reduced support, there are a number of alternative search strategies: Level-by-level independent No background knowledge of frequent itemsets is used for pruning. Each node is examined, regardless of whether or not its parent node is found to be frequent. 7.3.1 Mining Multilevel association rule * HD-ITR * Multilevel association rule A number of variations: For mining multipl
文档评论(0)