Krahasoni metodat

	PageRank i Drejtuar	Centraliteti i vetëvektorit
Fusha	Analiza e rrjeteve	Analiza e rrjeteve
Familja	Machine learning	Machine learning
Viti i origjinës	1998	1972
Krijuesi	Brin, S. & Page, L.	Bonacich, P.
Lloji	Iterative authority-scoring algorithm	Centrality measure
Burimi themelues	Brin, S. & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. Proceedings of the 7th International Conference on World Wide Web (WWW7), 107–117. Elsevier.	Bonacich, P. (1972). Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology, 2(1), 113–120.
Emërtime të tjera	PageRank, PR, Google PageRank, directed link analysis	eigenvector centrality, EC, Bonacich centrality, power centrality
Të lidhura	5	6
Përmbledhja	Directed PageRank is a link-based authority scoring algorithm that assigns importance scores to nodes in a directed graph by iteratively redistributing rank through outgoing edges. Introduced by Brin and Page in 1998 as the backbone of Google Search, it measures not just how many in-links a node has but how authoritative the nodes pointing to it are.	Eigenvector centrality, introduced by Bonacich in 1972, measures a node's influence by considering not just how many neighbors it has, but how influential those neighbors are. A node scores highly if it is connected to other high-scoring nodes, making it a recursive, globally-aware measure of structural importance in a network.