Efficient frequent pattern mining algorithm prepost and fin C + + source code

Prepost C + + source see http://www.cis.pku.edu.cn/faculty/system/dengzhihong/Source%20Code/prepost.cpp.
Algorithm content See thesis: A New algorithm for Fast Mining frequent itemsets Using n-lists)
Paper free: http://info.scichina.com:8084/sciFe/EN/abstract/abstract508369.shtml or http://www.cis.pku.edu.cn/faculty/ System/dengzhihong/dengzhihong.htm

Fin C + + source see http://www.cis.pku.edu.cn/faculty/system/dengzhihong/Source%20Code/fin.cpp.
Algorithm content See thesis: Fast Mining frequent itemsets using nodesets,
Paper: http://www.sciencedirect.com/science/article/pii/S0957417414000463 or Http://www.cis.pku.edu.cn/faculty/system /dengzhihong/dengzhihong.htm

Both algorithms give our team a new data structure based on the node set of the pattern tree, which is more efficient than the traditional mainstream mining algorithm, and can rewrite all the tasks related to frequent itemsets mining, such as closed mode, longest mode and top-k mode, etc.

Efficient frequent pattern mining algorithm prepost and fin C + + source code