ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

K-means 군집화×DBSCAN×t-SNE×
분야머신러닝머신러닝머신러닝
계열Machine learningMachine learningMachine learning
기원 연도1967 (formalized 1982)19962008
창시자MacQueen, J. B.; Lloyd, S. P.Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.van der Maaten, L. & Hinton, G.
유형Partitional clusteringDensity-based clustering algorithmNonlinear dimensionality reduction (manifold visualization)
원전Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231. link ↗van der Maaten, L. & Hinton, G. (2008). Visualizing Data using t-SNE. Journal of Machine Learning Research, 9(86), 2579–2605. link ↗
별칭k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-meansDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringt-SNE (Boyut İndirgeme / Görselleştirme), t-distributed stochastic neighbor embedding, tsne
관련433
요약K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data analysis.DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.t-SNE (t-Distributed Stochastic Neighbor Embedding) is a nonlinear dimensionality-reduction method introduced by Laurens van der Maaten and Geoffrey Hinton in 2008 that maps high-dimensional data into a 2D or 3D space for visualization. It preserves probabilistic local similarities, so points that are neighbours in the original space stay close together, revealing cluster structure and local neighbourhoods.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED
  1. v1
  2. 1 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: K-means · DBSCAN · t-SNE. 2026-06-19에 다음에서 검색함: https://scholargate.app/ko/compare