这是一个fp-growth算法，十分有用

VC6.0 C语言实现的简单FP-growth算法，数据挖掘的基础算法-VC6.0 C language implementation of a simple FP-growth algorithm, the basis of data mining algorithms

用Fp-tree这个结构来查找频繁项藉，不管在性能还是鲁棒性都比经典算法aprior算法优-With Fp-tree structure to find the frequent items of this by, whether in the performance and robustness of the algorithm is superior than the classical algorithm aprior

fp-growth的c实现算法fp-growth将发现所有的频繁项目集的过程分为以下两步：构造频繁模式树fp-tree；调用fp-growth(挖掘出所有的频繁项目集。-fp-growth of the c fp-growth algorithm will find all the frequent item sets is divided into the following two-step process: frequent pattern tree structure fp-tree

FP增长树算法C++实现，用于挖掘频繁项，产生关联规则。-FP growth tree the algorithm C++ achieve, for mining frequent item and associated rules.