ScholarGate
Msaidizi

Linganisha mbinu

Pitia mbinu ulizochagua bega kwa bega; safu zinazotofautiana zinaangaziwa.

Ukuu wa Ukaribu Ulioelekezwa×PageRank Iliyoelekezwa×
NyanjaUchanganuzi wa MitandaoUchanganuzi wa Mitandao
FamiliaMachine learningMachine learning
Mwaka wa asili1979–19941998
MwanzilishiFreeman, L. C.; Wasserman, S. & Faust, K.Brin, S. & Page, L.
AinaCentrality measureIterative authority-scoring algorithm
Chanzo asiliaWasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38269-4Brin, 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. link ↗
Majina mbadaladirected closeness, in-closeness centrality, out-closeness centrality, directional closenessPageRank, PR, Google PageRank, directed link analysis
Zinazohusiana55
MuhtasariDirected closeness centrality extends the classical closeness measure to directed networks by separately quantifying how quickly a node can be reached by others (in-closeness) and how quickly it can reach all others (out-closeness). It is a foundational node-level metric in social network analysis and graph theory, used wherever link direction conveys meaningful asymmetry such as citation flows, information cascades, or authority hierarchies.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.
ScholarGateSeti ya data
  1. v1
  2. 2 Vyanzo
  3. PUBLISHED
  1. v1
  2. 2 Vyanzo
  3. PUBLISHED

Nenda kwenye utafutaji Pakua slaidi

ScholarGateLinganisha mbinu: Directed Closeness Centrality · Directed PageRank. Imepatikana 2026-06-19 kutoka https://scholargate.app/sw/compare