Please use this identifier to cite or link to this item:
Title: A ranking algorithm for online social network search
Authors: Sharma, Divya
Alam, A.K.Z.
Dasgupta, Partha Sarathi
Saha, Debashish
Keywords: Algorithm
Online social network
Search ranking
Issue Date: 2013
Publisher: SCOPUS
Compute 2013 - 6th ACM India Computing Convention: Next Generation Computing Paradigms and Technologies
Abstract: Online Social Networks have become the new arena for people to stay in touch, pursue their interests and collaborate. In October 2012, Facebook reported a whopping 1 billion users which is testimony of the fact how online social networks have proliferated and made inroads into the real world. Some of the obvious advantages of social networks are (1) 24X7 availability allowing users to stay in virtual touch at any time of the day, (2) get in touch with people who have similar interests and collaborate with them and (3) the ability to be able to search for users to add to one's friend circle. The third advantage is the focus of this paper. With the increasing number of users on online social networks, it is important that when a user searches for another user, appropriate results are returned. This paper identifies three criteria - proximity, similarity and interaction, which can be used to rank search results so that more appropriate results are presented to the searching user. Also, this algorithm allows the search ranking to be customized according to the nature of the online social network in question. © 2013 ACM.
Description: Sharma, Divya, IIM Calcutta, D.H. Road, Joka, Kolkata 700104, India; Alam, A.K.Z., IIM Calcutta, D.H. Road, Joka, Kolkata 700104, India; Dasgupta, Partha Sarathi, IIM Calcutta, D.H. Road, Joka, Kolkata 700104, India; Saha, Debashish, IIM Calcutta, D.H. Road, Joka, Kolkata 700104, India
ISSN/ISBN - 978-145032545-5
DOI - 10.1145/2522548.2523134
Appears in Collections:Management Information Systems

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.