ScholarGate
Asystent

Porównaj metody

Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.

DBSCAN×Klasteryzacja hierarchiczna×Grupowanie K-średnich (K-means Clustering)×
DziedzinaUczenie maszynoweUczenie maszynoweUczenie maszynowe
RodzinaMachine learningMachine learningMachine learning
Rok powstania199619631967 (formalized 1982)
TwórcaEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Ward, J. H.MacQueen, J. B.; Lloyd, S. P.
TypDensity-based clustering algorithmUnsupervised clustering (agglomerative)Partitional clustering
Źródło pierwotneEster, 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 ↗Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137. DOI ↗
Inne nazwyDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringk-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means
Pokrewne344
PodsumowanieDBSCAN 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.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.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.
ScholarGateZbiór danych
  1. v1
  2. 1 Źródła
  3. PUBLISHED
  1. v1
  2. 1 Źródła
  3. PUBLISHED
  1. v1
  2. 2 Źródła
  3. PUBLISHED

Przejdź do wyszukiwania Pobierz slajdy

ScholarGatePorównaj metody: DBSCAN · Hierarchical Clustering · K-means. Pobrano 2026-06-19 z https://scholargate.app/pl/compare