基于隐空间映射的带符号网络上的顶点分类

社会网络顶点分类在解决实际问题中有广泛的应用，但绝大多数现有的网络顶点分类算法都集中在无符号的网络，而在边上具有符号的社交网络上的顶点分类算法却很少，且负链接对于符号网络分析的作用大于正链接。研究了符号网络中顶点的分类问题。首先将正、负网络映射到相对应的隐空间，提出基于隐空间的正负链接的数学模型；然后提出优化该模型的迭代算法，通过对隐空间矩阵和映射矩阵的迭代优化，来对网络中的顶点进行分类。由带符号的社会网络数据集的实验结果证明，该算法在数据集Epinions上得到结果的F1值在11以上，在数据集Slashdo上得到结果的F1值在23.8以上，与随机算法相比具有较高的精确度。

Node classification in signed networks based on latent space projection

Social network node classification is widely used in solving practical problems. Most of the existing network node classification algorithms focus on unsigned social networks,while node classification algorithms on social networks with symbols on edges are rare. Based on the fact that the negative links contribute more on signed network analysis than the positive links. The classification of nodes on signed networks was studied. Firstly, positive and negative networks were projected to the corresponding latent spaces, and a mathematical model was proposed based on positive and negative links in the latent spaces. Then, an iterative algorithm was proposed to optimize the model, and the iterative optimization of latent space matrix and projection matrix was used to classify the nodes in the network. The experimental results on the dataset of the signed social network show that the F1 value of the classification results by the proposed algorithm is higher than 11 on Epinions dataset, and that is higher than 23.8 on Slashdo dataset,which indicate that the proposed algorithm has higher accuracy than random algorithm.