ScholarGate
Asistente

Comparar métodos

Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.

DBSCAN×SVM de una clase×
CampoAprendizaje automáticoAprendizaje automático
FamiliaMachine learningMachine learning
Año de origen19961999–2001
Autor originalEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Scholkopf, B., Platt, J. C., Smola, A. J., Williamson, R. C.
TipoDensity-based clustering algorithmAnomaly / novelty detection (unsupervised)
Fuente 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 ↗Scholkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001). Estimating the support of a high-dimensional distribution. Neural Computation, 13(7), 1443–1471. DOI ↗
AliasDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringOCSVM, one-class support vector machine, novelty SVM, unsupervised SVM
Relacionados33
ResumenDBSCAN 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.One-class SVM is an unsupervised anomaly and novelty detection algorithm that learns a tight boundary around normal training data in a kernel-induced feature space, flagging new observations that fall outside that boundary as outliers. Introduced by Scholkopf et al. in 1999–2001, it extends the SVM framework to the single-class setting where no labelled anomalies are available.
ScholarGateConjunto de datos
  1. v1
  2. 1 Fuentes
  3. PUBLISHED
  1. v1
  2. 2 Fuentes
  3. PUBLISHED

Ir a la búsqueda Descargar diapositivas

ScholarGateComparar métodos: DBSCAN · One-class SVM. Recuperado el 2026-06-18 de https://scholargate.app/es/compare