Local Experts Finding Across Multiple Social Networks

被引:3
|
作者
Ma, Yuliang [1 ]
Yuan, Ye [1 ]
Wang, Guoren [2 ]
Wang, Yishu [1 ]
Ma, Delong [1 ]
Cui, Pengjie [1 ]
机构
[1] Northeastern Univ, Sch Comp Sci & Engn, Shenyang, Liaoning, Peoples R China
[2] Beijing Inst Technol, Sch Comp Sci & Technol, Beijing, Peoples R China
基金
中国国家自然科学基金; 中国博士后科学基金;
关键词
Local experts; Multiple social networks; Multiple graphs;
D O I
10.1007/978-3-030-18579-4_32
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:536 / 554
页数:19
相关论文
共 50 条
  • [31] Research on User Identification across Multiple Social Networks Based on Preference
    He, Zhiming
    Li, Wenjing
    [J]. PROCEEDINGS OF 2018 5TH IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND INTELLIGENCE SYSTEMS (CCIS), 2018, : 122 - 128
  • [32] Finding local community structure in networks
    Clauset, A
    [J]. PHYSICAL REVIEW E, 2005, 72 (02)
  • [33] Finding local communities in protein networks
    Konstantin Voevodski
    Shang-Hua Teng
    Yu Xia
    [J]. BMC Bioinformatics, 10
  • [34] Finding local communities in protein networks
    Voevodski, Konstantin
    Teng, Shang-Hua
    Xia, Yu
    [J]. BMC BIOINFORMATICS, 2009, 10 : 297
  • [35] Locating Experts via Online Social Networks
    Xu, Kuang
    Xie, Jing
    Li, Victor O. K.
    [J]. 2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [36] Hadoop⁃based local timing link prediction algorithm across social networks
    Kang S.-M.
    Zhang Y.-E.
    [J]. Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2022, 52 (03): : 626 - 632
  • [37] Enrichment of User Profiles across Multiple Online Social Networks for Volunteerism Matching for Social Enterprise
    Song, Xuemeng
    [J]. SIGIR'14: PROCEEDINGS OF THE 37TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, 2014, : 1282 - 1282
  • [38] Local Social Networks
    Sapuppo, Antonio
    Sorensen, Lene Tolstrup
    [J]. COMPUTER COMMUNICATION AND MANAGEMENT, 2011, 5 : 15 - 22
  • [39] Finding (Short) Paths in Social Networks
    Allavena, Andre
    Dasgupta, Anirban
    Hopcroft, John
    Kumar, Ravi
    [J]. INTERNET MATHEMATICS, 2006, 3 (02) : 129 - 146
  • [40] Finding Similar Users in Social Networks
    Nisgav, Aviv
    Patt-Shamir, Boaz
    [J]. SPAA'09: PROCEEDINGS OF THE TWENTY-FIRST ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2009, : 169 - 177