论文标题
签名网络中有效有效的核心计算
Effective and Efficient Core Computation in Signed Networks
论文作者
论文摘要
随着移动技术和IT开发的扩散，人们可以随时随地使用社交网络服务。在许多社交网络采矿问题中，由于其众多应用，识别有凝聚力的子图吸引了来自不同领域的许多关注。在许多有凝聚力的子图模型中，K核是最广泛使用的模型，因为其简单而直观的结构。在本文中，我们通过扩展K核心在签名网络中制定（P，N）。 （p，n） - 同时保证足够的内部正边缘和不足的内部负边。我们正式证明找到一个精确的（p，n） - 核是NP-HARD。因此，我们提出了三种有效算法来找到解决方案。使用现实世界和合成网络，我们证明了我们提出的算法的优越性。
With the proliferation of mobile technology and IT development, people can use social network services at any place and anytime. Among many social network mining problems, identifying cohesive subgraphs attract many attentions from different fields due to its numerous applications. Among many cohesive subgraph models, k-core is the most widely used model due to its simple and intuitive structure. In this paper, we formulate (p,n)-core in signed networks by extending k-core. (p,n)-core simultaneously guarantees sufficient internal positive edges and deficient internal negative edges. We formally prove that finding an exact (p,n)-core is NP-hard. Hence, we propose three efficient and effective algorithms to find a solution. Using real-world and synthetic networks, we demonstrate the superiority of our proposed algorithms.
