The Strength of Considering Tie Strength in Social Interest Profiling

被引:1
作者
Chader, Asma [1 ]
Haddadou, Hamid [1 ]
Hamdad, Leila [1 ]
Hidouci, Walid-Khaled [1 ]
机构
[1] Ecole Natl Super Informat ESI, Lab Commun Syst Informat LCSI, BP 68M, Algiers 16309, Algeria
来源
JOURNAL OF WEB ENGINEERING | 2020年 / 19卷 / 3-4期
关键词
Social profiling; user profile; relationship strength; weighted social networks; egocentric networks; NETWORKS; CENTRALITY; WEIGHT;
D O I
10.13052/jwe1540-9589.19345
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
With the emergence of social networking platforms and great amount of generated content, analyzing people interactions and behaviour raises new opportunities for several applications such as user interest profiling. In this context, this paper highlights the importance of considering relationship strength to infer more refined and relevant interests from user's direct neighbourhood. We propose WeiCoBSP, a Weight-aware Community-Based Social Profiling approach that leverages strength of ego-friend and friend-friend relationships. The former, describing connections with the profiled user, allows to identify most relevant people from whom to infer worthwhile interests. The latter qualifies connections among user's neighbourhood and enables depicting the most realistic community structure of the network. We present an empirical evaluation performed on real world co-authorship networks, validating our approach. Experimental results demonstrate the ability of WeiCoBSP to infer user's interest accurately, improving greatly the unweighted CoBSP process but also results of experiments assessing separately ego-friend and friend-friend relationships strength.
引用
收藏
页码:457 / 501
页数:45
相关论文
共 44 条
[31]  
On-at S, 2016, INT CONF RES CHAL, P87
[32]  
On-at S, 2014, 2014 NINTH INTERNATIONAL CONFERENCE ON DIGITAL INFORMATION MANAGEMENT (ICDIM), P80
[33]   Triadic closure in two-mode networks: Redefining the global and local clustering coefficients [J].
Opsahl, Tore .
SOCIAL NETWORKS, 2013, 35 (02) :159-167
[34]   Node centrality in weighted networks: Generalizing degree and shortest paths [J].
Opsahl, Tore ;
Agneessens, Filip ;
Skvoretz, John .
SOCIAL NETWORKS, 2010, 32 (03) :245-251
[35]   Clustering in weighted networks [J].
Opsahl, Tore ;
Panzarasa, Pietro .
SOCIAL NETWORKS, 2009, 31 (02) :155-163
[36]  
Pennacchiotti Marco, 2011, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD'11, P430
[37]   Inferring user interests in microblogging social networks: a survey [J].
Piao, Guangyuan ;
Breslin, John G. .
USER MODELING AND USER-ADAPTED INTERACTION, 2018, 28 (03) :277-329
[38]   TERM RELEVANCE WEIGHTS IN ONLINE INFORMATION-RETRIEVAL [J].
SALTON, G ;
WALDSTEIN, RK .
INFORMATION PROCESSING & MANAGEMENT, 1978, 14 (01) :29-35
[39]  
Shubankar K, 2011, IEEE DATA MINING, P96, DOI 10.1109/DMO.2011.5976511
[40]  
Siehndel Patrick, 2012, POSTERS DEMONSTRATIO, V914, P61