방법 비교

	ECLAT 빈발 항목 집합 마이닝	형식 개념 분석 (FCA)	FP-성장 (빈발 패턴 성장)
분야	머신러닝	소프트 컴퓨팅	머신러닝
계열	Machine learning	Machine learning	Machine learning
기원 연도	2000	1982	2000
창시자	Mohammed J. Zaki	Rudolf Wille & Bernhard Ganter	Jiawei Han, Jian Pei & Yiwen Yin
유형	Frequent-itemset mining algorithm (vertical format)	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.	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	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	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.	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.