原创力文档- 1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
- 2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
- 4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
- 5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传，每下载1次， 网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
幻灯片1-ComputerScienceUniversityofVermont.ppt
* Efficiency Analysis Facts: usually FP-tree is much smaller than the size of the DB Pattern base is smaller than original FP-tree Conditional FP-tree is smaller than pattern base ? mining process works on a set of usually much smaller pattern bases and conditional FP-trees Divide-and-conquer and dramatic scale of shrinking FP-Growth Mining Frequent Patterns without Candidate Generation (SIGMOD2000) Experiments: Performance Evaluation Mining Frequent Patterns without Candidate Generation (SIGMOD2000) * Experiment Setup Compare the runtime of FP-growth with classical Apriori and recent TreeProjection Runtime vs. min_sup Runtime per itemset vs. min_sup Runtime vs. size of the DB (# of transactions) Synthetic data sets : frequent itemsets grows exponentially as minisup goes down D1: T25.I10.D10K 1K items avg(transaction size)=25 avg(max/potential frequent item size)=10 10K transactions D2: T25.I20.D100K 10k items Experiments Mining Frequent Patterns without Candidate Generation (SIGMOD2000) * Scalability: runtime vs. min_sup (w/ Apriori) Experiments Mining Frequent Patterns without Candidate Generation (SIGMOD2000) * Runtime/itemset vs. min_sup Experiments Mining Frequent Patterns without Candidate Generation (SIGMOD2000) * Scalability: runtime vs. # of Trans. (w/ Apriori) * Using D2 and min_support=1.5% Experiments Mining Frequent Patterns without Candidate Generation (SIGMOD2000) * Scalability: runtime vs. min_support (w/ TreeProjection) Experiments Mining Frequent Patterns without Candidate Generation (SIGMOD2000) * Scalability: runtime vs. # of Trans. (w/ TreeProjection) Experiments Mining Frequent Patterns without Candidate Generation (SIGMOD2000) Support = 1% Discussions: Improve the performance and scalability of FP-growth Mining Frequent Patterns without Candidate Generation (SIGMOD2000) * Performance Improvement Discussion Mining Frequent Patterns without Candidate Generation (SIGMOD2000) Projected DBs Disk-resident FP-tree FP-tree Materialization
文档评论（0）