skip to main content
10.1145/2181176.2181177acmconferencesArticle/Chapter ViewAbstractPublication PageseurosysConference Proceedingsconference-collections
research-article

Diverging towards the common good: heterogeneous self-organisation in decentralised recommenders

Published: 10 April 2012 Publication History

Abstract

Decentralised social networks promise to deliver highly personalised, privacy-preserving, scalable and robust implementations of key social network features, such as search, query extensions, and recommendations. Such systems go beyond traditional online social networks by leveraging implicit social ties to implement personalised services. Yet, current decentralised social systems usually treat all users uniformly, when different sub-communities of users might in fact work best with different mechanisms. In this paper, we look at the specific case of decentralised social networks seeking to cluster users exhibiting similar behaviours to provide decentralised recommendations. These decentralised recommendation systems typically rely on a single metric applied uniformly to all users to extract similarities, while it seems natural that there is no such one-size-fits-all approach. More specifically we show in this paper, using a real Twitter trace, that (i) individual users can benefit from a personalised strategy in the context of decentralised recommendation systems, and that (ii) overall system performance is improved when the system accounts for the varying needs of its users i.e. when each user is allowed to diverge and use its optimal strategy.

References

[1]
M. Bertier, D. Frey, R. Guerraoui, A.-M. Kermarrec, and V. Leroy. The gossple anonymous social network. In Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware (Middleware '2010), pages 191--211, Bangalore, India, 2010.
[2]
J. Carretero, F. Isaila, A.-M. Kermarrec, F. Taïani, and J. M. Tirado. Geology: Modular georecommendation in gossip-based social networks. In IEEE 32nd Int. Conf. on Dist. Computing Sys. (ICDCS 2012), Macau, China, June 2012.
[3]
M. Jelasity and O. Babaoglu. T-man: Gossip-based overlay topology management. In 3rd Int. Workshop on Engineering Self-Organising App., 2005.
[4]
M. Jelasity, S. Voulgaris, R. Guerraoui, A.-M. Kermarrec, and M. van Steen. Gossip-based peer sampling. ACM ToCS, 25, August 2007.
[5]
Y. Koren. Factorization meets the neighborhood: a multifaceted collaborative filtering model. In Proc. of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '08), pages 426--434, Las Vegas, Nevada, USA, 2008.
[6]
J. M. Pujol, V. Erramilli, G. Siganos, X. Yang, N. Laoutaris, P. Chhabra, and P. Rodriguez. The little engine(s) that could: scaling online social networks. In Proceedings of the ACM SIGCOMM 2010 conference (SIGCOMM 2010), pages 375--386, New Delhi, India.
[7]
S. Scellato, A. Noulas, and C. Mascolo. Exploiting place features in link prediction on location-based social networks. In Proc. of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD '11), pages 1046--1054, 2011.
[8]
S. Voulgaris and M. v. Steen. Epidemic-style management of semantic overlays for content-based searching. In Proceedings of the 11th international Euro-Par conference on Parallel Processing (Euro-Par'05), pages 1143--1152.

Cited By

View all
  • (2018)An undergraduate ethics course for promoting common good computingJournal of Computing Sciences in Colleges10.5555/3282588.328259434:2(39-45)Online publication date: 1-Dec-2018
  • (2017)Handling Churn in Similarity Based Clustering Overlays Using Weighted Benefit2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)10.1109/PDCAT.2017.00069(384-391)Online publication date: Dec-2017
  • (2017)Optimum Benefit ProtocolJournal of Parallel and Distributed Computing10.1016/j.jpdc.2017.05.013109:C(129-141)Online publication date: 1-Nov-2017
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SNS '12: Proceedings of the Fifth Workshop on Social Network Systems
April 2012
75 pages
ISBN:9781450311649
DOI:10.1145/2181176
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 April 2012

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. decentralisation
  2. gossip protocols
  3. recommendation
  4. social networks

Qualifiers

  • Research-article

Funding Sources

Conference

EuroSys '12
Sponsor:
EuroSys '12: Seventh EuroSys Conference 2012
April 10, 2012
Bern, Switzerland

Upcoming Conference

EuroSys '25
Twentieth European Conference on Computer Systems
March 30 - April 3, 2025
Rotterdam , Netherlands

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2018)An undergraduate ethics course for promoting common good computingJournal of Computing Sciences in Colleges10.5555/3282588.328259434:2(39-45)Online publication date: 1-Dec-2018
  • (2017)Handling Churn in Similarity Based Clustering Overlays Using Weighted Benefit2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)10.1109/PDCAT.2017.00069(384-391)Online publication date: Dec-2017
  • (2017)Optimum Benefit ProtocolJournal of Parallel and Distributed Computing10.1016/j.jpdc.2017.05.013109:C(129-141)Online publication date: 1-Nov-2017
  • (2017)Scalable Anti-KNN: Decentralized Computation of k-Furthest-Neighbor Graphs with HyFNDistributed Applications and Interoperable Systems10.1007/978-3-319-59665-5_7(101-114)Online publication date: 24-May-2017
  • (2015)Increasing Coverage in Distributed Search and Recommendation with Profile DiversityTransactions on Large-Scale Data- and Knowledge-Centered Systems XXII - Volume 943010.1007/978-3-662-48567-5_4(115-144)Online publication date: 1-Jul-2015
  • (2015)SimilitudeProceedings of the 15th IFIP WG 6.1 International Conference on Distributed Applications and Interoperable Systems - Volume 903810.1007/978-3-319-19129-4_5(51-65)Online publication date: 2-Jun-2015
  • (2014)Adaptation for the massesProceedings of the 13th Workshop on Adaptive and Reflective Middleware10.1145/2677017.2677021(1-6)Online publication date: 8-Dec-2014
  • (2014)Exploiting Diversification in Gossip-Based RecommendationData Management in Cloud, Grid and P2P Systems10.1007/978-3-319-10067-8_3(25-36)Online publication date: 2014

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media