ScholarGate
Асистент

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

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Графови невронни мрежи×Персистентна хомология×
ОбластМрежови анализТопология
СемействоProcess / pipelineMachine learning
Година на възникване2017–2018 (major variants)2002
СъздателEdelsbrunner, Letscher & Zomorodian
ТипDeep learning on graph-structured dataTopological feature extraction algorithm
Основополагащ източникKipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. International Conference on Learning Representations (ICLR). DOI ↗Edelsbrunner, H., Letscher, D., & Zomorodian, A. (2002). Topological persistence and simplification. Discrete & Computational Geometry, 28(4), 511–533. DOI ↗
Други названияGNN, GCN, GAT, GraphSAGETopological Persistence, Persistence Barcodes, Persistent Betti Numbers, Kalıcı Homoloji
Свързани52
РезюмеA Graph Neural Network (GNN) is a deep learning architecture that operates directly on graph-structured data by combining node features with structural information through iterative neighborhood message passing. The three canonical variants — the Graph Convolutional Network (GCN) introduced by Kipf and Welling in 2017, the Graph Attention Network (GAT) introduced by Veličković et al. in 2018, and GraphSAGE — differ in how they aggregate neighbor information: GCN applies a spectral convolution over the full adjacency, GAT weights neighbors by learned attention scores, and GraphSAGE samples and aggregates local neighborhoods inductively, enabling generalization to unseen nodes.Persistent homology is a method in topological data analysis that quantifies the multi-scale topological structure of data by tracking connected components, loops, and voids as a scale parameter varies. Introduced by Edelsbrunner, Letscher, and Zomorodian in 2002, it encodes topological features through their birth and death scales, producing persistence diagrams or barcodes that serve as compact, coordinate-free descriptors of shape. The approach is robust to noise and provides a mathematically rigorous bridge between discrete data and algebraic topology.
ScholarGateНабор от данни
  1. v1
  2. 3 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Graph Neural Network (Network Analysis) · Persistent Homology. Извлечено на 2026-06-18 от https://scholargate.app/bg/compare