ScholarGate
Assistent

Sammenlign metoder

Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.

DBSCAN×Hierarkisk gruppering×UMAP×
FagfeltMaskinlæringMaskinlæringMaskinlæring
FamilieMachine learningMachine learningMachine learning
Opprinnelsesår199619632018
OpphavspersonEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Ward, J. H.McInnes, L.; Healy, J.; Melville, J.
TypeDensity-based clustering algorithmUnsupervised clustering (agglomerative)Nonlinear manifold-learning dimension reduction
Opprinnelig kildeEster, 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 ↗McInnes, L., Healy, J. & Melville, J. (2018). UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction. arXiv:1802.03426. link ↗
AliasDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clusteringUMAP (Uniform Manifold Approximation and Projection), uniform manifold approximation and projection, manifold dimension reduction
Relaterte345
SammendragDBSCAN 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.UMAP (Uniform Manifold Approximation and Projection) is a fast, scalable nonlinear dimension-reduction method grounded in manifold-learning theory, introduced by McInnes, Healy and Melville in 2018. It compresses high-dimensional data into a low-dimensional embedding for visualisation and downstream analysis.
ScholarGateDatasett
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: DBSCAN · Hierarchical Clustering · UMAP. Hentet 2026-06-19 fra https://scholargate.app/no/compare