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

	Видобування частих наборів елементів ECLAT	Видобування асоціативних правил (Apriori)	Формальний аналіз понять (ФАП)	FP-Growth (Frequent Pattern Growth)
Галузь	Машинне навчання	Машинне навчання	М'які обчислення	Машинне навчання
Родина	Machine learning	Machine learning	Machine learning	Machine learning
Рік появи	2000	1994	1982	2000
Автор методу	Mohammed J. Zaki	Rakesh Agrawal & Ramakrishnan Srikant	Rudolf Wille & Bernhard Ganter	Jiawei Han, Jian Pei & Yiwen Yin
Тип	Frequent-itemset mining algorithm (vertical format)	Unsupervised pattern discovery algorithm	Lattice-based knowledge representation / concept mining	Frequent-itemset mining algorithm
Основоположне джерело	Zaki, M. J. (2000). Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12(3), 372–390.	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.	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.
Інші назви	Eclat algorithm, vertical association mining, tidset intersection mining, ECLAT sık örüntü madenciliği	Market Basket Analysis, Frequent Itemset Mining, Birliktelik Kuralı Madenciliği, Itemset Association Analysis	FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme
Пов'язані	3	3	3	4
Підсумок	ECLAT, introduced by Mohammed Zaki in 2000, mines frequent itemsets using a vertical data representation: instead of scanning transactions, it stores for each item the set of transaction IDs (a tidset) that contain it, and computes the support of any itemset by intersecting tidsets. This depth-first, intersection-based approach is fast and memory-efficient, an alternative to Apriori's horizontal scans and FP-Growth's tree.	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.	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.