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

最大频繁模式树算法，可以自动识别集合中频繁出现的模式，在网页信息抽取中可以区分主回帖-Maximal frequent pattern tree algorithm, can automatically identify frequent patterns set in the Web information extraction can be distinguished in the main Replies

频繁模式挖掘Apriori算法 其中的.dat文件为样例数据, 具体使用方法参见main.c-Frequent Pattern Mining Apriori Algorithm

在数据挖掘频繁模式挖掘问题,典型算法的分析,是伪代码的分析,不是实际可以运行的代码，主要给的思路-Frequent pattern mining problem in data mining, the main algorithm analysis for typical algorithm, is the analysis of the pseudo code, give a train of thought