首页> 外文会议>International conference on database systems for advanced applications >Local Experts Finding Across Multiple Social Networks
【24h】

Local Experts Finding Across Multiple Social Networks

机译:跨多个社交网络寻找当地专家

获取原文

摘要

The local experts finding, which aims to identify a set of k people with specialized knowledge around a particular location, has become a hot topic along with the popularity of social networks, such as Twitter, Facebook. Local experts are important for many applications, such as answering local information queries, personalized recommendation. In many real-world applications, complete social information should be collected from multiple social networks, in which people usually participate in and active. However, previous approaches of local experts finding mostly focus on a single social network. In this paper, as far as we know, we are the first to study the local experts finding problem across multiple large social networks. Specifically, we want to identify a set of k people with the highest score, where the score of a person is a combination of local authority and topic knowledge of the person. To efficiently tackle this problem, we propose a novel framework, KTMSNs (knowledge transfer across multiple social networks). KTMSNs consists of two steps. Firstly, given a person over multiple social networks, we calculate the local authority and the topic knowledge, respectively. We propose a social topology-aware inverted index to speed up the calculation of the two values. Secondly, we propose a skyline-based strategy to combine the two values for obtaining the score of a person. Experimental studies on real social network datasets demonstrate the efficiency and effectiveness of our proposed approach.
机译:本地专家的发现旨在识别特定位置周围的k个人,并具有一定的专业知识,随着Twitter,Facebook等社交网络的普及,它已成为一个热门话题。本地专家对于许多应用程序都很重要,例如回答本地信息查询,个性化推荐。在许多实际应用中,应从人们通常参与并活跃的多个社交网络中收集完整的社交信息。但是,以前当地专家发现的方法主要集中在单个社交网络上。据我们所知,我们是第一个研究在多个大型社交网络中发现问题的本地专家的公司。具体来说,我们想确定一组具有最高分数的k个人,其中一个人的分数是该人的地方政府和主题知识的组合。为了有效解决此问题,我们提出了一个新颖的框架KTMSN(跨多个社交网络的知识转移)。 KTMSN包含两个步骤。首先,给定一个人通过多个社交网络,我们分别计算地方当局和主题知识。我们提出了一种社会拓扑感知的倒排索引,以加快两个值的计算。其次,我们提出了一种基于天际线的策略,将这两个值结合起来以获得一个人的分数。对真实社交网络数据集的实验研究证明了我们提出的方法的效率和有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号