Σύγκριση μεθόδων

	Κατευθυνόμενο PageRank	Ανίχνευση Κατευθυνόμενων Κοινοτήτων
Πεδίο	Ανάλυση Δικτύων	Ανάλυση Δικτύων
Οικογένεια	Machine learning	Machine learning
Έτος προέλευσης	1998	2008
Δημιουργός	Brin, S. & Page, L.	Leicht, E. A. & Newman, M. E. J.; Rosvall, M. & Bergstrom, C. T.
Τύπος	Iterative authority-scoring algorithm	Graph partitioning / modularity optimization
Θεμελιώδης πηγή	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.	Leicht, E. A. & Newman, M. E. J. (2008). Community structure in directed networks. Physical Review Letters, 100(11), 118703.
Εναλλακτικές ονομασίες	PageRank, PR, Google PageRank, directed link analysis	directed graph clustering, community detection in digraphs, directed modularity optimization, directed network partitioning
Συναφείς	5	6
Σύνοψη	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.	Directed community detection identifies densely interconnected groups of nodes in a directed network, accounting for the asymmetry of edges (e.g., A follows B does not imply B follows A). Adapting modularity or flow-based criteria to directed graphs reveals clusters that undirected methods systematically miss, making it essential for citation networks, follower graphs, and biological regulatory pathways.