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

	Apriori Algorithm	FP-Growth (ফ্রিকোয়েন্ট প্যাটার্ন গ্রোথ)
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1994	2000
প্রবর্তক	Agrawal, R. & Srikant, R.	Jiawei Han, Jian Pei & Yiwen Yin
ধরন	Frequent itemset and association rule mining algorithm	Frequent-itemset mining algorithm
মৌলিক উৎস	Agrawal, R. & Srikant, R. (1994). Fast algorithms for mining association rules. Proceedings of the 20th International Conference on Very Large Data Bases (VLDB), 487–499.	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.
অপর নাম	Apriori, frequent itemset mining, ARL-Apriori, Apriori association mining	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme
সম্পর্কিত	5	4
সারসংক্ষেপ	The Apriori algorithm, introduced by Agrawal and Srikant in 1994, is the foundational method for discovering frequent itemsets and association rules in transactional databases. It uses a breadth-first, level-wise search guided by the anti-monotone property of support to efficiently enumerate all item combinations that co-occur above a user-set minimum threshold, then extracts interpretable if-then rules from those patterns.	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.