Location:
Search - mushroom.d
Search list
Description: /*
The sample demonstrates how to build a decision tree for classifying mushrooms.
It uses the sample base agaricus-lepiota.data from UCI Repository, here is the link:
Newman, D.J. & Hettich, S. & Blake, C.L. & Merz, C.J. (1998).
UCI Repository of machine learning databases
[http://www.ics.uci.edu/~mlearn/MLRepository.html].
Irvine, CA: University of California, Department of Information and Computer Science.
*/
// loads the mushroom database, which is a text file, containing
// one training sample per row, all the input variables and the output variable are categorical,
// the values are encoded by characters.
Platform: |
Size: 4096 |
Author: tofighi |
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: