ScholarGate
Assistente

Comparar métodos

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

DBSCAN×OPTICS×
ÁreaAprendizado de máquinaAprendizado de máquina
FamíliaMachine learningMachine learning
Ano de origem19961999
Autor originalEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Ankerst, M.; Breunig, M. M.; Kriegel, H.-P.; Sander, J.
TipoDensity-based clustering algorithmDensity-based clustering (reachability ordering)
Fonte seminalEster, 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 ↗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 ↗
Outros nomesDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringOPTICS, Ordering Points To Identify the Clustering Structure, density-based clustering with reachability plot, generalized DBSCAN
Relacionados33
ResumoDBSCAN 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.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.
ScholarGateConjunto de dados
  1. v1
  2. 1 Fontes
  3. PUBLISHED
  1. v1
  2. 3 Fontes
  3. PUBLISHED

Ir para a pesquisa Baixar slides

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