Inferring Offline Hierarchical Ties from Online Social Networks
2014 (English)In: Proceedings of the companion publication of the 23rd international conference on World wide web companion, Association for Computing Machinery (ACM), 2014, 1261-1266 p.Conference paper (Refereed)
Social networks can represent many different types of relationships between actors, some explicit and some implicit. For example, email communications between users may be represented explicitly in a network, while managerial relationships may not. In this paper we focus on analyzing explicit interactions among actors in order to detect hierarchical social relationships that may be implicit. We start by employing three well-known ranking-based methods, PageRank, Degree Centrality, and Rooted-PageRank (RPR) to infer such implicit relationships from interactions between actors. Then we propose two novel approaches which take into account the time-dimension of interactions in the process of detecting hierarchical ties. We experiment on two datasets, the Enron email dataset to infer manager-subordinate relationships from email exchanges, and a scientific publication co-authorship dataset to detect PhD advisor-advisee relationships from paper co-authorships. Our experiments show that time-based methods perform considerably better than ranking-based methods. In the Enron dataset, they detect 48% of manager-subordinate ties versus 32% found by Rooted-PageRank. Similarly, in co-author dataset, they detect 62% of advisor-advisee ties compared to only 39% by Rooted-PageRank.
Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2014. 1261-1266 p.
Research subject Computer and Systems Sciences
IdentifiersURN: urn:nbn:se:su:diva-108636DOI: 10.1145/2567948.2580070ISBN: 978-1-4503-2745-9OAI: oai:DiVA.org:su-108636DiVA: diva2:759829
International World Wide Web Conference, Seoul, Republic of Korea, April 7 -11, 2014