विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| बहुभाषी ग्राफ तंत्रिका नेटवर्क× | ग्राफ न्यूरल नेटवर्क× | |
|---|---|---|
| क्षेत्र≠ | गहन अधिगम | नेटवर्क विश्लेषण |
| परिवार≠ | Machine learning | Process / pipeline |
| उद्भव वर्ष≠ | 2019 | 2017–2018 (major variants) |
| प्रवर्तक≠ | Various (Kipf & Welling 2017 for GNN; multilingual extensions from NLP community ~2019) | — |
| प्रकार≠ | Graph-based deep learning with multilingual node/edge features | Deep learning on graph-structured data |
| मौलिक स्रोत≠ | Kipf, T. N., & Welling, M. (2017). Semi-supervised classification with graph convolutional networks. In Proceedings of ICLR 2017. link ↗ | Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. International Conference on Learning Representations (ICLR). DOI ↗ |
| उपनाम≠ | Multilingual GNN, cross-lingual GNN, multilingual graph network, multilingual relational GNN | GNN, GCN, GAT, GraphSAGE |
| संबंधित | 5 | 5 |
| सारांश≠ | A Multilingual Graph Neural Network (Multilingual GNN) applies graph-based message-passing over nodes and edges that carry features from two or more languages. It is used for tasks such as cross-lingual entity alignment, multilingual knowledge-graph completion, and relation extraction across parallel or comparable corpora, allowing structural and semantic information from multiple languages to be jointly learned. | 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डेटासेट ↗ |
|
|