Simultaneous optimization for robust correlation estimation in partially observed social network

被引:10
|
作者
Zhang, Xiao-Yu [1 ]
机构
[1] Chinese Acad Sci, Inst Informat Engn, Beijing 100864, Peoples R China
基金
中国国家自然科学基金; 国家高技术研究发展计划(863计划);
关键词
Social network; Correlation estimation; Low-rank representation; Self-expressive matrix; Matrix recovery; ALGORITHM;
D O I
10.1016/j.neucom.2016.03.062
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Correlation estimation plays a critical role in numerous applications of social network analysis. Traditionally, the numerical records of the interaction between users are used as quantitative metrics of correlation. The deficiencies are threefold. Firstly, a single source of interaction is far from sufficient to reveal the underlying correlation. Secondly, the data available are often partially observed result from the imperfection in data acquisition and storage techniques, thereby jeopardizing the reliability of estimation. Thirdly, the inference from the explicit features to the implicit correlation is far from straightforward. Simply taking interaction as correlation is neither theoretically nor practically plausible. The former issue can be addressed via matrix completion, whereas the latter is essentially a self-expressive matrix representation problem. Instead of solving the two problems separately, in this paper, we propose a simultaneous optimization algorithm for robust correlation estimation based on partially observed data. In this way, the global, rather than local, optima can be achieved in an effective manner. The experiments on both synthetic and real-world social network data demonstrate the advantage of the proposed method. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:455 / 462
页数:8
相关论文
共 50 条