High-efficiency frequent mode mining algorithm PrePost and fin c ++ source code, prepostfin

High-efficiency frequent mode mining algorithm PrePost and fin c ++ source code, prepostfin

For the C ++ source code of PrePost, see http://www.cis.pku.edu.cn/faculty/system/dengzhihong/source%20code/prepost.cpp.
For details about the Algorithm, see A New Algorithm for Fast Mining Frequent Itemsets Using N-Lists)
Paper free: http://info.scichina.com: 8084/sciFe/EN/abstract/abstract508316.shtml or http://www.cis.pku.edu.cn/faculty/system/dengzhihong/dengzhihong.htm

For the C ++ source code of FIN, see http://www.cis.pku.edu.cn/faculty/system/dengzhihong/source%20code/fin.cpp.
For details about the algorithm, see Fast mining frequent itemsets using Nodesets,
Thesis: Workshop

These two algorithms give our group a novel Data Structure Based on the pattern tree node set, which is more efficient than the traditional mainstream mining algorithms, you can override all the tasks related to frequent itemset mining, such as closed mode, longest mode and TOP-K mode.