방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| Robust HDBSCAN× | 스펙트럼 군집화× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 2015 | 2002 |
| 창시자≠ | Campello, R.J.G.B.; Moulavi, D.; Zimek, A.; Sander, J. | Ng, A. Y.; Jordan, M. I.; Weiss, Y. |
| 유형≠ | Hierarchical density-based clustering with robust single-linkage | Graph-based clustering (spectral method) |
| 원전≠ | Campello, R.J.G.B., Moulavi, D., Zimek, A. & Sander, J. (2015). Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection. ACM Transactions on Knowledge Discovery from Data, 10(1), 5. DOI ↗ | Ng, A. Y., Jordan, M. I., & Weiss, Y. (2002). On Spectral Clustering: Analysis and an Algorithm. Advances in Neural Information Processing Systems, 14, 849–856. link ↗ |
| 별칭≠ | HDBSCAN*, Robust HDBSCAN*, robust hierarchical density clustering, robust single-linkage HDBSCAN | NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering |
| 관련≠ | 4 | 5 |
| 요약≠ | Robust HDBSCAN (HDBSCAN*) extends the original HDBSCAN algorithm with a robust single-linkage framework that handles noise, outliers, and clusters of varying densities more reliably. Introduced by Campello et al. (2015), it converts any density-based hierarchy into a stable flat clustering while explicitly modeling noise points — without requiring the user to pre-specify the number of clusters. | Spectral Clustering is a graph-based unsupervised learning algorithm, formalized by Ng, Jordan, and Weiss in 2002, that maps data points into a low-dimensional eigenspace derived from the similarity graph's Laplacian before applying k-means. This spectral embedding makes it possible to recover clusters of arbitrary shape — rings, crescents, interleaved spirals — that Euclidean distance-based methods consistently fail to separate. |
| ScholarGate데이터셋 ↗ |
|
|