ScholarGate
Assistente

Comparar métodos

Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.

DBSCAN×Graph Attention Network×Agrupamento Hierárquico×
ÁreaAprendizado de máquinaAprendizado profundoAprendizado de máquina
FamíliaMachine learningMachine learningMachine learning
Ano de origem199620181963
Autor originalEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Veličković, P. et al.Ward, J. H.
TipoDensity-based clustering algorithmGraph neural network (attention-based)Unsupervised clustering (agglomerative)
Fonte 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 ↗Veličković, P. et al. (2018). Graph Attention 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 ↗
Outros nomesDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringGraf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural networkHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
Relacionados344
ResumoDBSCAN 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.The Graph Attention Network (GAT), introduced by Veličković and colleagues in 2018, is a graph neural network variant that learns how much importance to assign to each neighbouring node through a self-attention mechanism. On heterogeneous neighbourhoods and relational classification it produces results superior to graph convolutional networks (GCN).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.
ScholarGateConjunto de dados
  1. v1
  2. 1 Fontes
  3. PUBLISHED
  1. v1
  2. 2 Fontes
  3. PUBLISHED
  1. v1
  2. 1 Fontes
  3. PUBLISHED

Ir para a pesquisa Baixar slides

ScholarGateComparar métodos: DBSCAN · Graph Attention Network · Hierarchical Clustering. Recuperado em 2026-06-19 de https://scholargate.app/pt/compare