Comparar métodos

	Minería de Reglas de Asociación (Apriori)	Agrupamiento K-Means	Inducción de Reglas (RIPPER)
Campo	Aprendizaje automático	Aprendizaje automático	Aprendizaje automático
Familia	Machine learning	Machine learning	Machine learning
Año de origen	1994	1967	1995
Autor original	Rakesh Agrawal & Ramakrishnan Srikant	MacQueen, J.	William W. Cohen
Tipo	Unsupervised pattern discovery algorithm	Partitional clustering (centroid-based)	Supervised rule learning algorithm
Fuente seminal	Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216.	MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297.	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	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering	RIPPER, Propositional Rule Learning, Kural Tümevarımı, Inductive Rule Learning
Relacionados	3	3	2
Resumen	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.	K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis.	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.