Integration of scientific and social networks

被引:17
作者
Neshati, Mahmood [1 ]
Hiemstra, Djoerd [2 ]
Asgari, Ehsaneddin [3 ]
Beigy, Hamid [1 ]
机构
[1] Sharif Univ Technol, Dept Comp Engn, Tehran, Iran
[2] Univ Twente, Database Res Grp, Elect Engn Math & Comp Sci EEMCS Dept, NL-7500 AE Enschede, Netherlands
[3] Ecole Polytech Fed Lausanne, Sch Comp & Commun Sci IC, CH-1015 Lausanne, Switzerland
来源
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS | 2014年 / 17卷 / 05期
关键词
Social network integration; Twitter; DBLP; Collective classification;
D O I
10.1007/s11280-013-0229-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we address the problem of scientific-social network integration to find a matching relationship between members of these networks (i.e. The DBLP publication network and the Twitter social network). This task is a crucial step toward building a multi environment expert finding system that has recently attracted much attention in Information Retrieval community. In this paper, the problem of social and scientific network integration is divided into two sub problems. The first problem concerns finding those profiles in one network, which presumably have a corresponding profile in the other network and the second problem concerns the name disambiguation to find true matching profiles among some candidate profiles for matching. Utilizing several name similarity patterns and contextual properties of these networks, we design a focused crawler to find high probable matching pairs, then the problem of name disambiguation is reduced to predict the label of each candidate pair as either true or false matching. Because the labels of these candidate pairs are not independent, state-of-the-art classification methods such as logistic regression and decision tree, which classify each instance separately, are unsuitable for this task. By defining matching dependency graph, we propose a joint label prediction model to determine the label of all candidate pairs simultaneously. Two main types of dependencies among candidate pairs are considered for designing the joint label prediction model which are quite intuitive and general. Using the discriminative approaches, we utilize various feature sets to train our proposed classifiers. An extensive set of experiments have been conducted on six test collection collected from the DBLP and the Twitter networks to show the effectiveness of the proposed joint label prediction model.
引用
收藏
页码:1051 / 1079
页数:29
相关论文
共 31 条
[1]  
[Anonymous], NIST SPECIAL PUBLICA
[2]  
[Anonymous], 2007, ACM Transactions on Knowledge Discovery from Data (TKDD), DOI [DOI 10.1145/1217299.1217304, 10.1145/1217299.1217304]
[3]  
[Anonymous], 2005, WWW '05
[4]  
[Anonymous], 2002, P 18 C UNCERTAINTY A
[5]  
[Anonymous], 2010, P 10 ANN JOINT C DIG, DOI 10.1145/1816123.1816130
[6]  
[Anonymous], 2003, IIWeb
[7]  
[Anonymous], 2001, PROC 18 INT C MACH L
[8]  
Balog Krisztian, 2007, 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, P551, DOI 10.1145/1277741.1277836
[9]   A language modeling framework for expert finding [J].
Balog, Krisztian ;
Azzopardi, Leif ;
de Rijke, Maarten .
INFORMATION PROCESSING & MANAGEMENT, 2009, 45 (01) :1-19
[10]  
Craswell N., 2001, SIGIR Forum, P250