ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

Knowledge Graph Embeddings×شبكة العصبونات الرسومية×
المجالتحليل الشبكاتتحليل الشبكات
العائلةMachine learningProcess / pipeline
سنة النشأة20132017–2018 (major variants)
صاحب الطريقةBordes, Usunier, García-Durán, Weston & Yakhnenko
النوعGraph representation learning via low-dimensional vector embeddingsDeep learning on graph-structured data
المصدر التأسيسيBordes, A., Usunier, N., García-Durán, A., Weston, J., & Yakhnenko, O. (2013). Translating embeddings for modeling multi-relational data. Advances in Neural Information Processing Systems, 26. link ↗Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. International Conference on Learning Representations (ICLR). DOI ↗
الأسماء البديلةKG Embeddings, Knowledge Graph Representation Learning, Relational Embeddings, Bilgi Grafı GömmeGNN, GCN, GAT, GraphSAGE
ذات صلة35
الملخصKnowledge Graph Embeddings (KGE) are a family of methods that represent entities and relations in a knowledge graph as dense, low-dimensional vectors in a continuous space. The foundational model, TransE, was introduced by Bordes, Usunier, García-Durán, Weston, and Yakhnenko in 2013. TransE treats each relation as a translation in embedding space — the head entity vector plus the relation vector should approximate the tail entity vector for any true triple (h, r, t). This simple geometric principle enabled effective link prediction and knowledge base completion at scale.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مجموعة البيانات
  1. v1
  2. 1 المصادر
  3. PUBLISHED
  1. v1
  2. 3 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Knowledge Graph Embeddings · Graph Neural Network (Network Analysis). استُرجع بتاريخ 2026-06-15 من https://scholargate.app/ar/compare