方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 形式概念分析 (FCA)× | 层次聚类× | |
|---|---|---|
| 领域≠ | 软计算 | 机器学习 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1982 | 1963 |
| 提出者≠ | Rudolf Wille & Bernhard Ganter | Ward, J. H. |
| 类型≠ | Lattice-based knowledge representation / concept mining | 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. DOI ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| 别名≠ | FCA, concept lattice analysis, Galois lattice, biçimsel kavram analizi | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| 相关≠ | 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. | 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. |
| ScholarGate数据集 ↗ |
|
|