Порівняння методів

	Видобування асоціативних правил (Apriori)	Формальний аналіз понять (ФАП)	Кластеризація методом k-середніх	Індукція правил (RIPPER)
Галузь	Машинне навчання	М'які обчислення	Машинне навчання	Машинне навчання
Родина	Machine learning	Machine learning	Machine learning	Machine learning
Рік появи	1994	1982	1967	1995
Автор методу	Rakesh Agrawal & Ramakrishnan Srikant	Rudolf Wille & Bernhard Ganter	MacQueen, J.	William W. Cohen
Тип	Unsupervised pattern discovery algorithm	Lattice-based knowledge representation / concept mining	Partitional clustering (centroid-based)	Supervised rule learning algorithm
Основоположне джерело	Agrawal, R., Imieliński, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. ACM SIGMOD, 207–216.	Wille, R. (1982). Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival (Ed.), Ordered Sets (pp. 445–470). Reidel.	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.
Інші назви	Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis	FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering	RIPPER, Propositional Rule Learning, Kural Tümevarımı, Inductive Rule Learning
Пов'язані	3	3	3	2
Підсумок	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.	Formal concept analysis derives a hierarchy of concepts from a simple table of which objects have which attributes. Founded by Rudolf Wille in 1982 on lattice theory, it pairs each set of objects with the attributes they all share to form 'formal concepts', then organizes these into a concept lattice — a mathematically grounded, interpretable hierarchy used for knowledge discovery, ontology building, and explainable analysis of categorical data.	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.