首页 课程资源 数据库     /    关联规则fpgrowthc、c#和matlab算法附讲解文档

关联规则fpgrowthc、c#和matlab算法附讲解文档

上传者: qq_34763204 | 上传时间:2018/8/26 12:51:28 | 文件大小:2.92MB | 文件类型:rar
关联规则fpgrowthc、c#和matlab算法附讲解文档
FP-tree是一个数据库里跟产生频繁集有关的信息的紧缩表示。
该实现基于Windows平台,编程工具是VisualC++6.0,许多地方还用到了C++的标准模板库。
另外还附带c#和matlab版本

文件下载

资源详情

[{"title":"(69个子文件2.92MB)关联规则fpgrowthc、c#和matlab算法附讲解文档","children":[{"title":"fpgrowth","children":[{"title":"data.cpp <span style='color:#111;'>2.92KB</span>","children":null,"spread":false},{"title":"item.cpp <span style='color:#111;'>1.07KB</span>","children":null,"spread":false},{"title":"51CTO下载-FP_Growth.rar <span style='color:#111;'>945.06KB</span>","children":null,"spread":false},{"title":"data.h <span style='color:#111;'>732B</span>","children":null,"spread":false},{"title":"fpgrowth.h <span style='color:#111;'>563B</span>","children":null,"spread":false},{"title":"fp增长算法.txt <span style='color:#111;'>8.22KB</span>","children":null,"spread":false},{"title":"fptree.h <span style='color:#111;'>1.10KB</span>","children":null,"spread":false},{"title":"FP-GrowthAssiciationRuleMining(matlab)","children":[{"title":"main.m <span style='color:#111;'>762B</span>","children":null,"spread":false},{"title":"data2.mat <span style='color:#111;'>6.03KB</span>","children":null,"spread":false},{"title":"www.yarpiz.com.url <span style='color:#111;'>121B</span>","children":null,"spread":false},{"title":"新建文本文档.txt <span style='color:#111;'>2.23KB</span>","children":null,"spread":false},{"title":"license.txt <span style='color:#111;'>1.32KB</span>","children":null,"spread":false},{"title":"matlab.mat <span style='color:#111;'>284.77KB</span>","children":null,"spread":false},{"title":"FPGrowth.m <span style='color:#111;'>5.49KB</span>","children":null,"spread":false},{"title":"GetPowerSet.m <span style='color:#111;'>678B</span>","children":null,"spread":false},{"title":"desktop.ini <span style='color:#111;'>46B</span>","children":null,"spread":false},{"title":"DATA.txt <span style='color:#111;'>27.87MB</span>","children":null,"spread":false},{"title":"data8.mat <span style='color:#111;'>1.12MB</span>","children":null,"spread":false},{"title":"mydata.mat <span style='color:#111;'>1.56KB</span>","children":null,"spread":false},{"title":"PlotTree.m <span style='color:#111;'>919B</span>","children":null,"spread":false},{"title":"data1.mat <span style='color:#111;'>2.85KB</span>","children":null,"spread":false},{"title":"GetNonTrivialSubsets.m <span style='color:#111;'>595B</span>","children":null,"spread":false},{"title":"DisplayRules.m <span style='color:#111;'>743B</span>","children":null,"spread":false},{"title":"IsSame.m <span style='color:#111;'>470B</span>","children":null,"spread":false},{"title":"data.m <span style='color:#111;'>297B</span>","children":null,"spread":false}],"spread":false},{"title":"src","children":[{"title":"fpgrowth.c <span style='color:#111;'>18.04KB</span>","children":null,"spread":false},{"title":"tract.c <span style='color:#111;'>40.81KB</span>","children":null,"spread":false},{"title":"fptree.h <span style='color:#111;'>3.18KB</span>","children":null,"spread":false},{"title":"scan.h <span style='color:#111;'>4.86KB</span>","children":null,"spread":false},{"title":"makefile <span style='color:#111;'>3.18KB</span>","children":null,"spread":false},{"title":"memsys.h <span style='color:#111;'>1.89KB</span>","children":null,"spread":false},{"title":"fptree.c <span style='color:#111;'>24.12KB</span>","children":null,"spread":false},{"title":"memsys.c <span style='color:#111;'>3.67KB</span>","children":null,"spread":false},{"title":"tract.h <span style='color:#111;'>11.45KB</span>","children":null,"spread":false},{"title":"scan.c <span style='color:#111;'>37.88KB</span>","children":null,"spread":false},{"title":"fpgrowth.mak <span style='color:#111;'>3.00KB</span>","children":null,"spread":false}],"spread":false},{"title":"testfpgrowth.cpp <span style='color:#111;'>1.50KB</span>","children":null,"spread":false},{"title":"fpgrowth.cpp <span style='color:#111;'>2.20KB</span>","children":null,"spread":false},{"title":"Makefile <span style='color:#111;'>560B</span>","children":null,"spread":false},{"title":"fpTree(c#).rar <span style='color:#111;'>94.72KB</span>","children":null,"spread":false},{"title":"数据挖掘关联规则FP-growth算法.doc <span style='color:#111;'>120.00KB</span>","children":null,"spread":false},{"title":"51CTO下载-数据挖掘关联规则FP-growth算法.doc <span style='color:#111;'>120.00KB</span>","children":null,"spread":false},{"title":"fptree.cpp <span style='color:#111;'>4.95KB</span>","children":null,"spread":false},{"title":"FP-TREE(c算法)","children":[{"title":"fp-growth.plg <span style='color:#111;'>1.22KB</span>","children":null,"spread":false},{"title":"b.txt <span style='color:#111;'>31B</span>","children":null,"spread":false},{"title":"fp-growth.vcxproj <span style='color:#111;'>6.14KB</span>","children":null,"spread":false},{"title":"fp-growth.sdf <span style='color:#111;'>6.56MB</span>","children":null,"spread":false},{"title":"fp-growth.dsw <span style='color:#111;'>543B</span>","children":null,"spread":false},{"title":"fp-growth.sln <span style='color:#111;'>963B</span>","children":null,"spread":false},{"title":"fp-growth.opt <span style='color:#111;'>52.50KB</span>","children":null,"spread":false},{"title":"fp-growth.cpp <span style='color:#111;'>3.70KB</span>","children":null,"spread":false},{"title":"fp-growth.dsp <span style='color:#111;'>3.36KB</span>","children":null,"spread":false},{"title":"fp-growth.opensdf <span style='color:#111;'>34B</span>","children":null,"spread":false},{"title":"fp-growth.ncb <span style='color:#111;'>41.00KB</span>","children":null,"spread":false},{"title":"a.txt <span style='color:#111;'>31B</span>","children":null,"spread":false},{"title":"Backup","children":null,"spread":false},{"title":"UpgradeLog.htm <span style='color:#111;'>33.27KB</span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"vc120.pdb <span style='color:#111;'>84.00KB</span>","children":null,"spread":false},{"title":"fp-growth.tlog","children":[{"title":"CL.write.1.tlog <span style='color:#111;'>276B</span>","children":null,"spread":false},{"title":"CL.read.1.tlog <span style='color:#111;'>3.99KB</span>","children":null,"spread":false},{"title":"unsuccessfulbuild <span style='color:#111;'>0B</span>","children":null,"spread":false},{"title":"cl.command.1.tlog <span style='color:#111;'>620B</span>","children":null,"spread":false},{"title":"fp-growth.lastbuildstate <span style='color:#111;'>164B</span>","children":null,"spread":false}],"spread":false},{"title":"fp-growth.log <span style='color:#111;'>810B</span>","children":null,"spread":false},{"title":"vc60.idb <span style='color:#111;'>89.00KB</span>","children":null,"spread":false},{"title":"vc120.idb <span style='color:#111;'>91.00KB</span>","children":null,"spread":false},{"title":"fp-growth.exe <span style='color:#111;'>164.05KB</span>","children":null,"spread":false},{"title":"vc60.pdb <span style='color:#111;'>132.00KB</span>","children":null,"spread":false},{"title":"fp-growth.ilk <span style='color:#111;'>183.92KB</span>","children":null,"spread":false}],"spread":false}],"spread":false},{"title":"item.h <span style='color:#111;'>1.08KB</span>","children":null,"spread":false}],"spread":false}],"spread":true}]

评论信息

免责申明

【好快吧下载】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【好快吧下载】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【好快吧下载】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,8686821#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明