방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 광학× | 스펙트럼 군집화× | |
|---|---|---|
| 분야 | 머신러닝 | 머신러닝 |
| 계열 | Machine learning | Machine learning |
| 기원 연도≠ | 1999 | 2002 |
| 창시자≠ | Ankerst, M.; Breunig, M. M.; Kriegel, H.-P.; Sander, J. | Ng, A. Y.; Jordan, M. I.; Weiss, Y. |
| 유형≠ | Density-based clustering (reachability ordering) | Graph-based clustering (spectral method) |
| 원전≠ | 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 ↗ | 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 ↗ |
| 별칭≠ | OPTICS, Ordering Points To Identify the Clustering Structure, density-based clustering with reachability plot, generalized DBSCAN | NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering |
| 관련≠ | 3 | 5 |
| 요약≠ | 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. | 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데이터셋 ↗ |
|
|