- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Mining Quantitative Correlated Patterns Using an Information利用信息挖掘定量关联模式
Mining Quantitative Correlated Patterns Using an Information-Theoretic Approach Yiping Ke, James Cheng, Wilfred Ng Presentation Outline: Contributions of the paper Introduction What are QCPs? Definitions Background Information Theory (entropy, MI, NMI) Mining QCPs All-confidence Discretization problem (interval combining) Attribute-level pruning Interval-level pruning QCoMine algorithm Contributions of the paper Presents a new algorithm for mining patterns on databases based on theory borrowed from information theory: entropy mutual information Achieves discretization of attribute domain using supervised interval combining to preserve dependency between attributes Introduction Similar to association rule mining in principle but evaluating for association rules can be too expensive on VLDBs Trivial result-set {pregnant} ? {edema} {pregnant, female} ? {edema} Unproductive rules as a result of co-occurrence effects {pregnant, dataminer} ? {edema}. So occupation and edema condition are related? Unlike association mining, mining for QCP consider the dependency of the attribute sets of the database to generate highly correlated patterns Similar to generating “maximal informative k-itemsets”, but here we consider dependency in the attribute sets Introduction…contd. The idea behind mining QCP Evaluate the attribute set and look for ‘strong’ dependencies between attributes Next find correlated interval sets in the dependent attributes and generate patterns from them Thus, QCPs are not restricted by frequently co-occurring attributes Definitions: Quantitative Database A pattern X, is a set of attributes or random variable = {x1, x2, x3, …, xm} whose outcomes can be numerical or quantitative and have possibilities p(vx) = {p1, p2, p3, …, pm} These attributes can be either categorical in which case domain of xi, dom(x) is in the interval {lx, ux} where lx = ux And it is quantitative if where xi[lx, ux] is the interval of xi, lx = ux A pattern X is called a k-pattern if |att
您可能关注的文档
- Lowering the Barrier to Wireless and Mobile Experimentation降低无线和移动实验的障碍.ppt
- Math Plus Fun, Counting Problems UC Santa Barbara数学加有趣计数问题加州圣巴巴拉.ppt
- Math Plus Fun, Math Illusions UC Santa Barbara数学加有趣数学幻想加州大学巴巴拉分校.ppt
- Math Plus Fun, Measurement Puzzles UC Santa Barbara数学加有趣测量难题加州大学圣巴巴拉.ppt
- Math Plus Fun, Math Meets Maps UC Santa Barbara数学加有趣数学符合地图加州大学巴巴拉分校.ppt
- Math Roots amphi对数学的根.ppt
- Love for Our Neighbors Story of Ruth爱我们的邻居鲁思的故事.ppt
- Mail flow and transport deep dive video邮件流和传输深度潜水视频.ch9.ms.pptx
- Mathematical Epidemiology DIMACS数学流行病学摘要.ppt
- Mathematical Ideas Norfolk State University数学思想诺福克州立大学.ppt
原创力文档


文档评论(0)