ScholarGate
Assistente

Confronta i metodi

Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.

DBSCAN×Albero decisionale×Clustering K-Means×
CampoApprendimento automaticoApprendimento automaticoApprendimento automatico
FamigliaMachine learningMachine learningMachine learning
Anno di origine199619841967
IdeatoreEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Breiman, Friedman, Olshen & StoneMacQueen, J.
TipoDensity-based clustering algorithmRecursive partitioning (if-then rules)Partitional clustering (centroid-based)
Fonte seminaleEster, 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., Friedman, J.H., Olshen, R.A. & Stone, C.J. (1984). Classification and Regression Trees. Wadsworth. DOI ↗MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297. link ↗
AliasDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringKarar Ağacı (Decision Tree), karar ağacı, classification tree, regression treeK-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering
Correlati353
SintesiDBSCAN 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.A Decision Tree is an interpretable classification and regression method, formalised by Breiman, Friedman, Olshen and Stone in their 1984 CART framework, that partitions the data with hierarchical if-then rules. Each split sends observations down one branch or another until a prediction is read off the leaf.K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis.
ScholarGateInsieme di dati
  1. v1
  2. 1 Fonti
  3. PUBLISHED
  1. v1
  2. 1 Fonti
  3. PUBLISHED
  1. v1
  2. 1 Fonti
  3. PUBLISHED

Vai alla ricerca Scarica le diapositive

ScholarGateConfronta i metodi: DBSCAN · Decision Tree · K-Means Clustering. Consultato il 2026-06-19 da https://scholargate.app/it/compare