$\mathcal{DS}^{4}$ : Introducing Semantic Friendship in Distributed Social Networks

ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS: OTM 2013 CONFERENCES(2013)

引用 2|浏览6
暂无评分
摘要
Existing social networks are based on centralised architectures that manage users, store data, and monitor the security policy of the system. In this work, we present \(\mathcal{DS}^{4}\), a Distributed Social and Semantic Search System that allows users to share and search for content among friends and clusters of users that specialise on the query topic. In \(\mathcal{DS}^{4}\), nodes that are semantically, thematically, or socially similar are automatically discovered and logically organised into groups. Content retrieval is then performed by routing queries towards social friends and clusters of nodes that are likely to answer them. In this way, search receives two facets: the social facet, addressing friends, and the semantic facet, addressing nodes that are semantically close to the queries. Our experiments demonstrate that searching only among friends is not effective in distributed social networks, and showcase the necessity and importance of semantic friendship.
更多
查看译文
关键词
Online Social Network,Query Time,Semantic Grouping,Query Message,Communication Load
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要