Porównaj metody

	Centralność PageRank	Osadzanie grafów wiedzy
Dziedzina	Analiza sieci	Analiza sieci
Rodzina	Machine learning	Machine learning
Rok powstania	1999	2013
Twórca	Page, Brin, Motwani & Winograd	Bordes, Usunier, García-Durán, Weston & Yakhnenko
Typ	Iterative link-based centrality algorithm	Graph representation learning via low-dimensional vector embeddings
Źródło pierwotne	Page, L., Brin, S., Motwani, R., & Winograd, T. (1999). The PageRank citation ranking: Bringing order to the web. Stanford InfoLab Technical Report.	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.
Inne nazwy	Google PageRank, Random Surfer Model, Link-Based Ranking, PageRank Merkeziliği	KG Embeddings, Knowledge Graph Representation Learning, Relational Embeddings, Bilgi Grafı Gömme
Pokrewne	2	3
Podsumowanie	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.	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.