Confronta i metodi

	Association Rule Mining (Apriori)	FP-Growth (Frequent Pattern Growth)	Induzione di Regole (RIPPER)
Campo	Apprendimento automatico	Apprendimento automatico	Apprendimento automatico
Famiglia	Machine learning	Machine learning	Machine learning
Anno di origine	1994	2000	1995
Ideatore	Rakesh Agrawal & Ramakrishnan Srikant	Jiawei Han, Jian Pei & Yiwen Yin	William W. Cohen
Tipo	Unsupervised pattern discovery algorithm	Frequent-itemset mining algorithm	Supervised rule learning algorithm
Fonte seminale	Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216.	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.	Cohen, W. W. (1995). Fast effective rule induction. Proceedings of the 12th International Conference on Machine Learning, 115–123.
Alias	Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme	RIPPER, Propositional Rule Learning, Kural Tümevarımı, Inductive Rule Learning
Correlati	3	4	2
Sintesi	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.	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.	Rule Induction, and specifically the RIPPER (Repeated Incremental Pruning to Produce Error Reduction) algorithm, is a supervised machine learning method that learns a compact set of IF-THEN classification rules from labeled training data. Introduced by William W. Cohen in 1995, RIPPER applies a separate-and-conquer strategy combined with minimum description length (MDL) pruning to generate rules that are both accurate and interpretable, making it a landmark algorithm in the field of inductive rule learning.