방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 레이블 전파× | 그래프 신경망× | |
|---|---|---|
| 분야≠ | 머신러닝 | 네트워크 분석 |
| 계열≠ | Machine learning | Process / pipeline |
| 기원 연도≠ | 2002 | 2017–2018 (major variants) |
| 창시자≠ | Zhu, X. & Ghahramani, Z. | — |
| 유형≠ | Graph-based semi-supervised classification | Deep learning on graph-structured data |
| 원전≠ | Zhu, X., & Ghahramani, Z. (2002). Learning from labeled and unlabeled data with label propagation. Technical Report CMU-CALD-02-107, Carnegie Mellon University. link ↗ | Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. International Conference on Learning Representations (ICLR). DOI ↗ |
| 별칭≠ | LP, label spreading, graph-based semi-supervised learning, harmonic label propagation | GNN, GCN, GAT, GraphSAGE |
| 관련≠ | 3 | 5 |
| 요약≠ | Label Propagation is a graph-based semi-supervised learning algorithm introduced by Zhu and Ghahramani in 2002 that spreads class labels from a small set of labeled nodes to a large set of unlabeled nodes by iteratively diffusing label information along the edges of a similarity graph, exploiting the manifold structure of the data. | 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. |
| ScholarGate데이터셋 ↗ |
|
|