ScholarGate
Asystent

Porównaj metody

Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.

Skierowany PageRank×Analiza społecznych sieci skierowanych×
DziedzinaAnaliza sieciAnaliza sieci
RodzinaMachine learningMachine learning
Rok powstania19981994
TwórcaBrin, S. & Page, L.Wasserman, S. & Faust, K.
TypIterative authority-scoring algorithmStructural analysis of directed graphs
Źródło pierwotneBrin, 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 ↗Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1
Inne nazwyPageRank, PR, Google PageRank, directed link analysisdirected SNA, digraph analysis, directed graph network analysis, asymmetric network analysis
Pokrewne55
PodsumowanieDirected 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 Social Network Analysis (directed SNA) studies networks in which every tie has an explicit direction — from a sender to a receiver — rather than treating relationships as symmetric. It extends the classical SNA toolkit with in-degree, out-degree, reciprocity, and asymmetric path measures, making it the appropriate framework wherever relationship direction carries substantive meaning, such as citation flows, advice-seeking, follower graphs, or information cascades.
ScholarGateZbiór danych
  1. v1
  2. 2 Źródła
  3. PUBLISHED
  1. v1
  2. 2 Źródła
  3. PUBLISHED

Przejdź do wyszukiwania Pobierz slajdy

ScholarGatePorównaj metody: Directed PageRank · Directed Social Network Analysis. Pobrano 2026-06-18 z https://scholargate.app/pl/compare