手法を比較

	指向性ソーシャルネットワーク分析	Directed PageRank
分野	ネットワーク分析	ネットワーク分析
系統	Machine learning	Machine learning
提唱年	1994	1998
提唱者	Wasserman, S. & Faust, K.	Brin, S. & Page, L.
種類	Structural analysis of directed graphs	Iterative authority-scoring algorithm
原典	Wasserman, S. & Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge University Press. ISBN: 978-0-521-38707-1	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.
別名	directed SNA, digraph analysis, directed graph network analysis, asymmetric network analysis	PageRank, PR, Google PageRank, directed link analysis
関連	5	5
概要	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.	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.