ScholarGate
Assistente

Comparar métodos

Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.

HDBSCAN Robusto×DBSCAN×
ÁreaAprendizado de máquinaAprendizado de máquina
FamíliaMachine learningMachine learning
Ano de origem20151996
Autor originalCampello, R.J.G.B.; Moulavi, D.; Zimek, A.; Sander, J.Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.
TipoHierarchical density-based clustering with robust single-linkageDensity-based clustering algorithm
Fonte seminalCampello, 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 ↗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 ↗
Outros nomesHDBSCAN*, Robust HDBSCAN*, robust hierarchical density clustering, robust single-linkage HDBSCANDBSCAN Kümeleme, density-based clustering, density-based spatial clustering
Relacionados43
ResumoRobust 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.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.
ScholarGateConjunto de dados
  1. v1
  2. 2 Fontes
  3. PUBLISHED
  1. v1
  2. 1 Fontes
  3. PUBLISHED

Ir para a pesquisa Baixar slides

ScholarGateComparar métodos: Robust HDBSCAN · DBSCAN. Recuperado em 2026-06-15 de https://scholargate.app/pt/compare