ScholarGate
Asystent

Porównaj metody

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

Analiza społecznych sieci skierowanych×Skierowany PageRank×
DziedzinaAnaliza sieciAnaliza sieci
RodzinaMachine learningMachine learning
Rok powstania19941998
TwórcaWasserman, S. & Faust, K.Brin, S. & Page, L.
TypStructural analysis of directed graphsIterative authority-scoring algorithm
Źródło pierwotneWasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1Brin, 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 ↗
Inne nazwydirected SNA, digraph analysis, directed graph network analysis, asymmetric network analysisPageRank, PR, Google PageRank, directed link analysis
Pokrewne55
PodsumowanieDirected 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.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.
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 Social Network Analysis · Directed PageRank. Pobrano 2026-06-18 z https://scholargate.app/pl/compare