Description: FP-growth算法的改进C++程序,具有较好的扩展性和应用性,本程序改成用行读取，然后在内存中解析。更有效的方式是采用块读取方式（本人在以前项目中验证过，速度大为提高。）-FP-growth algorithm C++ Procedures, have good scalability and application, the procedure changed to use line to read, and then resolve in memory. More effective approach is the use of block-read mode (I tested before the project, speed greatly improved.) Platform: |
Size: 1803264 |
Author:laizhengwen |
Hits:
Description: FP-growth 算法，包括了建树和挖掘部分。
代码风格良好，可读性强，运算速度快,
accident.dat, 340000条数据，50 支持度，建树和挖掘时间100秒左右，mushroom.dat, 8000条记录，建树和挖掘不超过8秒-FP-growth algorithm， written with c++,(ide is visual c++ 2008). The program is very fast and robust，for data of accident.dat(340000 items,min support 50 ), the program runs in less than 100s, for mushroom.dat(8000 item), the program runs in less than 8s Platform: |
Size: 6951936 |
Author:cy |
Hits:
Description: FP-Tree的.net实现有完整说明，很好很强大的一个程序-The FP-Tree. Net to achieve a complete description of a very powerful program Platform: |
Size: 1646592 |
Author:彭鑫 |
Hits:
Description: 本人已经调通的FP-TREE算法，VS2010下C++程序。该算法结构输出置信度和支持度，给出的源程序种包含测试数据fpdata.dat。调试了好久才调通。一定要注意：数据集里每一行数据，不能有重读出现的数字。这也是FP-TREE数据挖掘算法的的基本要求。数据集默认是.dat文件，也可以是txt-FP-TREE algorithm I has been transferred, VS2010 under C++ program. The output of the algorithm structure of confidence and support, given the source species contain test data fpdata.dat. Debugging a long time to transfer pass. Be sure to note: each row of data in the data set, you can not have a digital reread arise. This is also the FP-TREE data mining algorithms of the basic requirements. Datasets default. Dat file, it can be txt Platform: |
Size: 4775936 |
Author:xionglian |
Hits:
Search - program of fp tree