A ranking algorithm for online social network search

Compute Pub Date : 2013-08-22 DOI:10.1145/2522548.2523134
Divya Sharma, Akz Alam, P. Dasgupta, Debashis Saha
{"title":"A ranking algorithm for online social network search","authors":"Divya Sharma, Akz Alam, P. Dasgupta, Debashis Saha","doi":"10.1145/2522548.2523134","DOIUrl":null,"url":null,"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.","PeriodicalId":435920,"journal":{"name":"Compute","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Compute","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2522548.2523134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

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.
在线社交网络搜索的排序算法
在线社交网络已经成为人们保持联系、追求兴趣和合作的新舞台。2012年10月,Facebook报告称其用户高达10亿,这证明了在线社交网络如何激增并进入现实世界。社交网络的一些明显优势是:(1)全天候可用性,允许用户在一天中的任何时间保持虚拟联系;(2)与有相似兴趣的人保持联系并与他们合作;(3)能够搜索用户以添加到自己的朋友圈。第三个优势是本文的重点。随着在线社交网络上用户数量的增加,当一个用户搜索另一个用户时,返回适当的结果是很重要的。本文确定了三个标准——接近性、相似性和交互性,这三个标准可用于对搜索结果进行排序,以便向搜索用户提供更合适的结果。此外,该算法允许根据所讨论的在线社交网络的性质定制搜索排名。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书