People and entity retrieval in implicit social networks

Suman K Pathapati, Subhashini Venugopalan, Ashok Kumar, A. Bhamidipaty
{"title":"People and entity retrieval in implicit social networks","authors":"Suman K Pathapati, Subhashini Venugopalan, Ashok Kumar, A. Bhamidipaty","doi":"10.1109/IMSAA.2011.6156373","DOIUrl":null,"url":null,"abstract":"Online social networks can be viewed as implicit real world networks, that manage to capture a wealth of information about heterogeneous nodes and edges, which are highly interconnected. Such abundant data can be beneficial in finding and retrieving relevant people and entities within these networks. Effective methods of achieving this can be useful in systems ranging from recommender systems to people and entity discovery systems. Our main contribution in this paper is the proposal of a novel localized algorithm that operates on the sub graph of the social graph and retrieves relevant people or entities. We also demonstrate how such an algorithm can be used in large real world social networks and graphs to efficiently retrieve relevant people/entities.","PeriodicalId":445751,"journal":{"name":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 5th International Conference on Internet Multimedia Systems Architecture and Application","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMSAA.2011.6156373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Online social networks can be viewed as implicit real world networks, that manage to capture a wealth of information about heterogeneous nodes and edges, which are highly interconnected. Such abundant data can be beneficial in finding and retrieving relevant people and entities within these networks. Effective methods of achieving this can be useful in systems ranging from recommender systems to people and entity discovery systems. Our main contribution in this paper is the proposal of a novel localized algorithm that operates on the sub graph of the social graph and retrieves relevant people or entities. We also demonstrate how such an algorithm can be used in large real world social networks and graphs to efficiently retrieve relevant people/entities.
内隐社会网络中的人与实体检索
在线社交网络可以被视为隐式的现实世界网络,它设法捕获有关异构节点和边缘的丰富信息,这些节点和边缘是高度互联的。如此丰富的数据有助于在这些网络中查找和检索相关人员和实体。实现这一目标的有效方法在从推荐系统到人员和实体发现系统等系统中都很有用。我们在本文中的主要贡献是提出了一种新的局部算法,该算法在社交图的子图上操作并检索相关的人或实体。我们还演示了如何在大型现实世界的社交网络和图表中使用这种算法来有效地检索相关的人/实体。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信