Degree-like centrality with structural zeroes or ones: When is a neighbor not a neighbor? |
| |
Institution: | 1. School of Mathematics and Statistics, Shandong University, Weihai 264209, China;2. Department of Social Work, Shandong University, Weihai 264209, China;3. Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA |
| |
Abstract: | In the field of social network analysis, there are situations in which researchers hope to ignore certain dyads in the computation of centrality to avoid biased or misleading results, but simply deleting these dyads will result in wrong conclusions. There is little work considering this particular problem except the eigenvector-like centrality method presented in 2015. In this paper, we revisit this problem and present a new degree-like centrality method which also allows some dyads to be excluded in the calculations. This new method adopts the technique of weighted symmetric nonnegative matrix factorization (abbreviated as WSNMF), and we will show that it can be seen as the generalized version of the existing eigenvector-like centrality. After applying it to several data sets, we test this new method's efficiency. |
| |
Keywords: | Social network Centrality Matrix factorization Structural ones/zeroes Missing data |
本文献已被 ScienceDirect 等数据库收录! |
|