Time-aware Egocentric network-based User Profiling

被引:6
作者
Canut, Marie-Francoise [1 ]
On-At, Sirinya [1 ]
Peninou, Andre [1 ]
Sedes, Florence [1 ]
机构
[1] Univ Toulouse, IRIT, CNRS, UMR 5505, F-31062 Toulouse 9, France
来源
PROCEEDINGS OF THE 2015 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2015) | 2015年
关键词
User's Profile; Social Network; Egocentric Network; Time-aware Method;
D O I
10.1145/2808797.2809415
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Improving the egocentric network-based user's profile building process by taking into account the dynamic characteristics of social networks can be relevant in many applications. To achieve this aim, we propose to apply a time-aware method into an existing egocentric-based user profiling process, based on previous contributions of our team. The aim of this strategy is to weight user's interests according to their relevance and freshness. The time awareness weight of an interest is computed by combining the relevance of individuals in the user's egocentric network (computed by taking into account the freshness of their ties) with the information relevance (computed by taking into account its freshness). The experiments on scientific publications networks (DBLP/Mendeley) allow us to demonstrate the effectiveness of our proposition compared to the existing time-agnostic egocentric network-based user profiling process.
引用
收藏
页码:569 / 572
页数:4
相关论文
共 11 条
[1]  
Ding Y., 2005, Proceedings of the 14th ACM international conference on Information and knowledge management, CIKM 2005, P485, DOI DOI 10.1145/1099554.1099689
[2]  
Gauch S., 2007, The Adaptive Web. Methods and Strategies of Web Personalization, P54
[3]  
Guy I., 2009, P 3 ACM C REC SYST, P53, DOI DOI 10.1145/1639714.1639725
[4]   The link-prediction problem for social networks [J].
Liben-Nowell, David ;
Kleinberg, Jon .
JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, 2007, 58 (07) :1019-1031
[5]   Selecting examples for partial memory learning [J].
Maloof, MA ;
Michalski, RS .
MACHINE LEARNING, 2000, 41 (01) :27-52
[6]   Dynamics of Dyads in Social Networks: Assortative, Relational, and Proximity Mechanisms [J].
Rivera, Mark T. ;
Soderstrom, Sara B. ;
Uzzi, Brian .
ANNUAL REVIEW OF SOCIOLOGY, VOL 36, 2010, 36 :91-115
[7]  
Tan Bin, 2006, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '06), P718, DOI [10.1145/1150402.1150493, DOI 10.1145/1150402.1150493]
[8]   A community-based algorithm for deriving users' profiles from egocentrics networks: experiment on Facebook and DBLP [J].
Tchuente, Dieudonne ;
Canut, Marie-Francoise ;
Jessel, Nadine ;
Peninou, Andre ;
Sedes, Florence .
SOCIAL NETWORK ANALYSIS AND MINING, 2013, 3 (03) :667-683
[9]  
Tylenda T., 2009, P 13 INT C KNOWLEDGE, P1, DOI DOI 10.1145/1731011.1731020
[10]  
Weng LL, 2013, 19TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'13), P356