পদ্ধতির তুলনা করুন

	FP-Growth (ফ্রিকোয়েন্ট প্যাটার্ন গ্রোথ)	অ্যাসোসিয়েশন রুল মাইনিং (অ্যাপ্রিওরি)
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	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.