方法对比

	FP-Growth (频繁模式增长)	关联规则挖掘（Apriori）
领域	机器学习	机器学习
方法族	Machine learning	Machine learning
起源年份	2000	1994
提出者	Jiawei Han, Jian Pei & Yiwen Yin	Rakesh Agrawal & Ramakrishnan Srikant
类型	Frequent-itemset mining algorithm	Unsupervised pattern discovery algorithm
开创性文献	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.	Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216.
别名	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme	Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis
相关	4	3
摘要	FP-Growth, introduced by Jiawei Han, Jian Pei, and Yiwen Yin in 2000, mines frequent itemsets from transaction data without generating candidate sets, the costly step that slows the classic Apriori algorithm. It compresses the database into a frequent-pattern tree (FP-tree) in two scans, then grows frequent patterns recursively from that structure, making it dramatically faster than Apriori on large, dense datasets.	Association Rule Mining is an unsupervised data-mining technique that discovers co-occurrence patterns among items in transactional datasets. Formally introduced by Agrawal, Imieliński, and Swami in 1993, and refined with the landmark Apriori algorithm by Agrawal and Srikant in 1994, it identifies rules of the form X ⇒ Y — meaning that transactions containing itemset X tend to also contain itemset Y — quantified by support, confidence, and lift.