Порівняння методів
Переглядайте обрані методи поруч; рядки з відмінностями підсвічено.
| ОПТИКА× | Ієрархічна кластеризація× | |
|---|---|---|
| Галузь | Машинне навчання | Машинне навчання |
| Родина | Machine learning | Machine learning |
| Рік появи≠ | 1999 | 1963 |
| Автор методу≠ | Ankerst, M.; Breunig, M. M.; Kriegel, H.-P.; Sander, J. | Ward, J. H. |
| Тип≠ | Density-based clustering (reachability ordering) | Unsupervised clustering (agglomerative) |
| Основоположне джерело≠ | Ankerst, M., Breunig, M. M., Kriegel, H.-P., & Sander, J. (1999). OPTICS: Ordering points to identify the clustering structure. ACM SIGMOD Record, 28(2), 49–60. DOI ↗ | Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗ |
| Інші назви≠ | OPTICS, Ordering Points To Identify the Clustering Structure, density-based clustering with reachability plot, generalized DBSCAN | Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering |
| Пов'язані≠ | 3 | 4 |
| Підсумок≠ | OPTICS (Ordering Points To Identify the Clustering Structure) is a density-based clustering algorithm introduced by Ankerst, Breunig, Kriegel, and Sander in 1999. It generalizes DBSCAN by processing points in an ordering that encodes the full density-based cluster structure of a dataset, enabling the detection of clusters of varying densities through a reachability plot rather than requiring a fixed global density threshold. | 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Набір даних ↗ |
|
|