Methoden vergleichen

	Formale Begriffsanalyse (FBA)	K-Means-Clustering
Fachgebiet	Soft Computing	Maschinelles Lernen
Familie	Machine learning	Machine learning
Entstehungsjahr	1982	1967
Urheber	Rudolf Wille & Bernhard Ganter	MacQueen, J.
Typ	Lattice-based knowledge representation / concept mining	Partitional clustering (centroid-based)
Wegweisende Quelle	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.
Aliasnamen	FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering
Verwandt	3	3
Zusammenfassung	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.