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

Source: Internet
Author: User

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.

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.