ScholarGate
Assistent

Sammenlign metoder

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

DBSCAN×OPTICS×
FagfeltMaskinlæringMaskinlæring
FamilieMachine learningMachine learning
Opprinnelsesår19961999
OpphavspersonEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Ankerst, M.; Breunig, M. M.; Kriegel, H.-P.; Sander, J.
TypeDensity-based clustering algorithmDensity-based clustering (reachability ordering)
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 ↗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 ↗
AliasDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringOPTICS, Ordering Points To Identify the Clustering Structure, density-based clustering with reachability plot, generalized DBSCAN
Relaterte33
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.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.
ScholarGateDatasett
  1. v1
  2. 1 Kilder
  3. PUBLISHED
  1. v1
  2. 3 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: DBSCAN · OPTICS. Hentet 2026-06-17 fra https://scholargate.app/no/compare