เปรียบเทียบวิธี

	FP-Growth (Frequent Pattern Growth)	การวิเคราะห์แนวคิดเชิงรูปนัย (Formal Concept Analysis - FCA)
สาขาวิชา	การเรียนรู้ของเครื่อง	การคำนวณแบบอ่อน
ตระกูล	Machine learning	Machine learning
ปีกำเนิด	2000	1982
ผู้ริเริ่ม	Jiawei Han, Jian Pei & Yiwen Yin	Rudolf Wille & Bernhard Ganter
ประเภท	Frequent-itemset mining algorithm	Lattice-based knowledge representation / concept mining
แหล่งต้นตำรับ	Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. ACM SIGMOD Record, 29(2), 1–12.	Wille, R. (1982). Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival (Ed.), Ordered Sets (pp. 445–470). Reidel.
ชื่อเรียกอื่น	frequent pattern growth, FP-tree mining, FP-Growth algorithm, sık örüntü büyütme	FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi
ที่เกี่ยวข้อง	4	3
สรุป	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.	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.