Learning to Extract Expert Teams in Social Networks

被引:13
作者
Chang, Chih-Chieh [1 ]
Chang, Ming-Yi [2 ]
Jhang, Jhao-Yin [3 ]
Yeh, Lo-Yao [4 ]
Shen, Chih-Ya [3 ]
机构
[1] Natl Taipei Univ Business, Dept Accounting Informat, Taipei 100025, Taiwan
[2] Fu Jen Catholic Uni, Dept Sociol, Taipei 242062, Taiwan
[3] Natl Tsing Hua Univ, Dept Comp Sci, Hsinchu 300044, Taiwan
[4] Natl Cent Univ, Dept Informat Management, Taoyuan 320317, Taiwan
关键词
Social networking (online); Task analysis; Costs; Optimization; Machine learning algorithms; Urban areas; Linear programming; Graph algorithms; machine learning; social networks; team formation; OPTIMIZATION;
D O I
10.1109/TCSS.2022.3152179
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Finding a set of suitable experts with minimized communication overhead to perform a complex task finds a wide spectrum of applications in industry, education, and other scenarios. This class of problems, widely formulated as forming a team of experts in social networks (i.e., team formation problem), is very challenging due to its NP-hardness and has attracted much research attention. Although various effective and elegant algorithms have been proposed to address this important problem, the methods are usually manually designed and handcrafted, which require considerable human efforts. In this article, we make our first attempt to automate the algorithm design with a machine learning-based approach, named reinforcement learning-based expert team identification (RELEXT). Moreover, we also propose two novel graph embedding methods to consider two important dimensions of the team formation problem, i.e., the skill and social dimensions. We evaluate the proposed approaches on multiple large-scale real datasets. The experimental results show that our proposed approaches outperform the other baselines in terms of solution quality and efficiency.
引用
收藏
页码:1552 / 1562
页数:11
相关论文
共 44 条
[1]   Grouping Students in Educational Settings [J].
Agrawal, Rakesh ;
Golshan, Behzad ;
Terzi, Evimaria .
PROCEEDINGS OF THE 20TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'14), 2014, :1017-1026
[2]  
Anagnostopoulos A., 2010, ACM C INFORM KNOWLED, P599, DOI DOI 10.1145/1871437.1871515
[3]  
Anagnostopoulos A., 2012, P 21 INT C WORLD WID, P839, DOI DOI 10.1145/2187836.2187950
[4]   Algorithms for Hiring and Outsourcing in the Online Labor Market [J].
Anagnostopoulos, Aris ;
Castillo, Carlos ;
Fazzone, Adriano ;
Leonardi, Stefano ;
Terzi, Evimaria .
KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2018, :1109-1118
[5]  
[Anonymous], 2018, P INT C LEARN REPR
[6]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[7]  
Barrett TD, 2020, AAAI CONF ARTIF INTE, V34, P3251
[8]  
Bello I., 2017, ARXIV161109940, P1, DOI DOI 10.1109/TSMC.2020.2969317
[9]   Distance-generalized Core Decomposition [J].
Bonchi, Francesco ;
Khan, Arijit ;
Severini, Lorenzo .
SIGMOD '19: PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2019, :1006-1023
[10]  
Cappart Q, 2019, AAAI CONF ARTIF INTE, P1443