ScholarGate
Assistent

Jämför metoder

Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.

DBSCAN×Grafneuralnätverk×Hierarkisk klustring×
ÄmnesområdeMaskininlärningDjupinlärningMaskininlärning
FamiljMachine learningMachine learningMachine learning
Ursprungsår199620171963
UpphovspersonEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Kipf, T.N. & Welling, M.Ward, J. H.
TypDensity-based clustering algorithmDeep learning on graph-structured dataUnsupervised clustering (agglomerative)
UrsprungskällaEster, 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 ↗Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. ICLR. link ↗Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244. DOI ↗
AliasDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringGrafik Sinir Ağı (GNN), GNN, graph neural net, graph convolutional networkHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
Närliggande344
SammanfattningDBSCAN 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 Graph Neural Network (GNN) is a deep learning method, popularised by Kipf and Welling in 2017 with the Graph Convolutional Network, that learns from the relationships in network (graph) structures made of nodes and edges. It is designed for data that is naturally relational, such as social networks, molecular structures, and recommendation systems.Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.
ScholarGateDatamängd
  1. v1
  2. 1 Källor
  3. PUBLISHED
  1. v1
  2. 3 Källor
  3. PUBLISHED
  1. v1
  2. 1 Källor
  3. PUBLISHED

Gå till sökningen Ladda ner bildspel

ScholarGateJämför metoder: DBSCAN · Graph Neural Network · Hierarchical Clustering. Hämtad 2026-06-19 från https://scholargate.app/sv/compare