ScholarGate
Ассистент

Сравнение методов

Просматривайте выбранные методы рядом; строки с различиями подсвечены.

DBSCAN×Графовая сеть внимания (Graph Attention Network, GAT)×Графовая нейронная сеть×Иерархическая кластеризация×
ОбластьМашинное обучениеГлубокое обучениеГлубокое обучениеМашинное обучение
СемействоMachine learningMachine learningMachine learningMachine learning
Год появления1996201820171963
Автор методаEster, M., Kriegel, H.-P., Sander, J. & Xu, X.Veličković, P. et al.Kipf, T.N. & Welling, M.Ward, J. H.
ТипDensity-based clustering algorithmGraph neural network (attention-based)Deep learning on graph-structured dataUnsupervised clustering (agglomerative)
Основополагающий источникEster, 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 ↗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 ↗
Другие названияDBSCAN Kümeleme, density-based clustering, density-based spatial clusteringGraf Dikkat Ağı (GAT), GAT, graph attention network, attention-based graph neural networkGrafik Sinir Ağı (GNN), GNN, graph neural net, graph convolutional networkHiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
Связанные3444
Сводка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.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).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.
ScholarGateНабор данных
  1. v1
  2. 1 Источники
  3. PUBLISHED
  1. v1
  2. 2 Источники
  3. PUBLISHED
  1. v1
  2. 3 Источники
  3. PUBLISHED
  1. v1
  2. 1 Источники
  3. PUBLISHED

Перейти к поиску Скачать слайды

ScholarGateСравнение методов: DBSCAN · Graph Attention Network · Graph Neural Network · Hierarchical Clustering. Получено 2026-06-19 из https://scholargate.app/ru/compare