ScholarGate
Assistant

Comparer des méthodes

Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.

DBSCAN×Forêt Aléatoire×Machine à vecteurs de support (Classification)×
DomaineApprentissage automatiqueApprentissage automatiqueApprentissage automatique
FamilleMachine learningMachine learningMachine learning
Année d'origine199620011995
Auteur d'origineEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Breiman, L.Cortes, C. & Vapnik, V.
TypeDensity-based clustering algorithmEnsemble (bagging of decision trees)Maximum-margin classifier (kernel method)
Source fondatriceEster, 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 ↗Breiman, L. (2001). Random Forests. Machine Learning, 45, 5–32. DOI ↗Cortes, C. & Vapnik, V. (1995). Support-Vector Networks. Machine Learning, 20, 273–297. DOI ↗
AliasDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringRastgele Orman (Random Forest), rastgele orman, random decision forest, bagged tree ensembleDestek Vektör Makinesi (SVM — Sınıflandırma), support-vector network, SVM classifier, maximum-margin classifier
Apparentées345
Résumé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.Random Forest is an ensemble learning method, introduced by Leo Breiman in 2001, that grows many decision trees on bootstrap samples of the data and combines their votes to produce strong classification and regression. By pooling many slightly different trees, it produces more accurate and more stable predictions than any single tree.The Support Vector Machine, introduced by Corinna Cortes and Vladimir Vapnik in 1995, is a classifier that finds the optimal separating hyperplane between classes in a high-dimensional space. It chooses the boundary that leaves the widest possible margin to the nearest training points, which makes its decisions robust on new data.
ScholarGateJeu de données
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 2 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: DBSCAN · Random Forest · Support Vector Machine. Consulté le 2026-06-18 sur https://scholargate.app/fr/compare