Abstract
Users of social networks often focus on specific areas of that network, leading to the well-known "filter bubble" effect. Connecting people to a new area of the network in a way that will cause them to become active in that area could help alleviate this effect and improve social welfare. Here we present preliminary analysis of network referrals, that is, attempts by users to connect peers to other areas of the network. We classify these referrals by their efficiency, i.e., the likelihood that a referral will result in a user becoming active in the new area of the network. We show that by using features describing past experience of the referring author and the content of their messages we are able to predict whether referral will be effective, reaching an AUC of 0.87 for those users most experienced in writing efficient referrals. Our results represent a first step towards algorithmically constructing efficient referrals with the goal of mitigating the "filter bubble" effect pervasive in on line social networks.
Original language | English |
---|---|
Title of host publication | The Web Conference 2018 - Companion of the World Wide Web Conference, WWW 2018 |
Publisher | Association for Computing Machinery, Inc |
Pages | 23-24 |
Number of pages | 2 |
ISBN (Electronic) | 9781450356404 |
DOIs | |
State | Published - 23 Apr 2018 |
Externally published | Yes |
Event | 27th International World Wide Web, WWW 2018 - Lyon, France Duration: 23 Apr 2018 → 27 Apr 2018 |
Publication series
Name | The Web Conference 2018 - Companion of the World Wide Web Conference, WWW 2018 |
---|
Conference
Conference | 27th International World Wide Web, WWW 2018 |
---|---|
Country/Territory | France |
City | Lyon |
Period | 23/04/18 → 27/04/18 |
Bibliographical note
Publisher Copyright:© 2018 IW3C2 (International World Wide Web Conference Committee), published under Creative Commons CC BY 4.0 License.
Keywords
- filter bubble
- social networks
- web mining