We study the problem of detecting hierarchical ties in a social network by exploiting the interaction patterns between the actors (members) involved in the ...

Abstract. We study the problem of detecting hierarchical ties in a so- cial network by exploiting the interaction patterns between the actors.

We study the problem of detecting hierarchical ties in a social network by exploiting the interaction patterns between the actors (members) involved in the ...

We study the problem of detecting hierarchical ties in a social network by exploiting the interaction patterns between the actors (members) involved in the ...

Oct 31, 2014 · Using Time-Sensitive Rooted PageRank to Detect Hierarchical Social Relationships. Jaber, Mohammad. Papapetrou, Panagiotis. Stockholm University ...

Bibliographic details on Using Time-Sensitive Rooted PageRank to Detect Hierarchical Social Relationships.

We study the problem of detecting hierarchical ties in a social network by exploiting the interaction patterns between the actors (members) involved in the ...

Using Time-Sensitive Rooted PageRank to Detect Hierarchical Social Relationships · Mohammad JaberP. PapapetrouS. HelmerP. Wood. Computer Science. IDA. 2014.

(2014) Using time-sensitive rooted PageRank to detect hierarchical social relationships. In: Blockeel, H. and van Leeuwen, M. and Vinciotti, V. (eds ...

We start by employing three well-known ranking-based methods, PageRank, Degree Centrality, and Rooted-PageRank (RPR) to infer such implicit relationships from ...