Ranking algorithm by contacts priority for social communication systems

  • Authors:
  • Natalia Dudarenko;Juwel Rana;Kåre Synnes

  • Affiliations:
  • Department of Computer Science and Electrical Engineering, Luleå University of Technology, Luleå, Sweden;Department of Computer Science and Electrical Engineering, Luleå University of Technology, Luleå, Sweden;Department of Computer Science and Electrical Engineering, Luleå University of Technology, Luleå, Sweden

  • Venue:
  • ruSMART/NEW2AN'10 Proceedings of the Third conference on Smart Spaces and next generation wired, and 10th international conference on Wireless networking
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper presents the ranking algorithm by contacts priority with application for social communication services. This algorithm makes it possible to rank contacts in different social communication services by their priority for the user, and find a preferable communication tools for every contact in the social graph. It is proposed to determine priorities of the contacts using communication history. The ranking algorithm is based on the Markov chains theory and social strength calculation approach. The paper exploits the opportunities for measuring social strength for the contacts and also prioritizes communication tools for simplifying communication. The results are supported by an example.