השוואת שיטות

	ניתוח מושגים פורמלי (Formal Concept Analysis - FCA)	מחשוב גרנולרי (גרנולציה של מידע)	אשכול היררכי
תחום	מחשוב רך	מחשוב רך	למידת מכונה
משפחה	Machine learning	Machine learning	Machine learning
שנת המקור	1982	1997	1963
הוגה השיטה	Rudolf Wille & Bernhard Ganter	Lotfi A. Zadeh (information granulation); developed by Pedrycz, Skowron, Yao	Ward, J. H.
סוג	Lattice-based knowledge representation / concept mining	Framework for multi-granularity information processing	Unsupervised clustering (agglomerative)
מקור מכונן	Wille, R. (1982). Restructuring lattice theory: an approach based on hierarchies of concepts. In I. Rival (Ed.), Ordered Sets (pp. 445–470). Reidel.	Zadeh, L. A. (1997). Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets and Systems, 90(2), 111–127.	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.
כינויים	FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi	information granulation, computing with granules, three-way granular computing, tanecikli hesaplama	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
קשורות	3	3	4
תקציר	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.	Granular computing is a problem-solving paradigm that processes information in 'granules' — clumps of objects drawn together by indistinguishability, similarity, or functionality — rather than at the level of individual data points. Articulated by Lotfi Zadeh in 1997 as fuzzy information granulation and developed into a broad framework, it provides a unifying umbrella over fuzzy sets, rough sets, and interval methods, letting analysis move to whichever level of detail a problem actually requires.	Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.