Módszerek összehasonlítása
Tekintse át a kiválasztott módszereket egymás mellett; az eltérő sorok kiemelve jelennek meg.
| Centralitás-elemzés× | Grafikus ábrázolású tudásgráf beágyazások× | |
|---|---|---|
| Tudományterület | Hálózatelemzés | Hálózatelemzés |
| Módszercsalád≠ | Process / pipeline | Machine learning |
| Keletkezés éve≠ | 1979 | 2013 |
| Megalkotó≠ | Linton C. Freeman | Bordes, Usunier, García-Durán, Weston & Yakhnenko |
| Típus≠ | Descriptive / exploratory network measure family | Graph representation learning via low-dimensional vector embeddings |
| Alapmű≠ | Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239. DOI ↗ | 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 ↗ |
| Alternatív nevek | Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality | KG Embeddings, Knowledge Graph Representation Learning, Relational Embeddings, Bilgi Grafı Gömme |
| Kapcsolódó≠ | 5 | 3 |
| Összefoglaló≠ | Centrality analysis is a family of network-analytic measures, formalized by Freeman (1979), that quantifies the structural importance of individual nodes within a graph. Each centrality index captures a distinct mechanism of influence: degree centrality reflects direct connectivity, betweenness centrality identifies nodes that broker information flow, closeness centrality captures proximity to all others, and eigenvector centrality (along with PageRank) rewards connection to highly connected neighbors. | 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. |
| ScholarGateAdatkészlet ↗ |
|
|