手法を比較

	知識グラフ埋め込み	PageRank中心性	Word2Vec
分野	ネットワーク分析	ネットワーク分析	テキストマイニング
系統	Machine learning	Machine learning	Process / pipeline
提唱年	2013	1999	2013
提唱者	Bordes, Usunier, García-Durán, Weston & Yakhnenko	Page, Brin, Motwani & Winograd	Tomas Mikolov et al.
種類	Graph representation learning via low-dimensional vector embeddings	Iterative link-based centrality algorithm	Neural word-embedding model
原典	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.	Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank citation ranking: Bringing order to the web. Stanford InfoLab Technical Report.	Mikolov, T., Chen, K., Corrado, G. & Dean, J. (2013). Efficient Estimation of Word Representations in Vector Space.
別名	KG Embeddings, Knowledge Graph Representation Learning, Relational Embeddings, Bilgi Grafı Gömme	Google PageRank, Random Surfer Model, Link-Based Ranking, PageRank Merkeziliği	word embeddings, skip-gram, continuous bag-of-words, Word2Vec Kelime Gömülmeleri
関連	3	2	4
概要	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.	PageRank is a link-based centrality algorithm that assigns an importance score to each node in a directed graph by measuring how many high-quality nodes point to it. Introduced by Larry Page, Sergey Brin, Rajeev Motwani, and Terry Winograd at Stanford University in 1999, it became the mathematical foundation of the Google search engine and remains one of the most influential algorithms in network science and information retrieval.	Word2Vec is a neural word-embedding technique introduced by Mikolov and colleagues in 2013 that maps each word in a text corpus to a dense numeric vector. Words that appear in similar contexts end up close together in the vector space, so the embeddings capture semantic similarity that can be measured arithmetically.