中文摘要：

签署的网络是一个重要有点复杂的网络，它包括积极关系和否定关系。一个签署的网络的社区被定义为顶点，积极关系在以内并且在否定关系也在哪个之间是稠密的之间是稠密的并且在哪个之间的组。能识别签署的网络的社区对如此的网络的分析有用。迄今，为检测网络社区的许多算法被开发了。然而，他们中的大多数包括仅仅积极的关系专门为网络被设计并且不对签署的网络合适。签署的网络的采矿社区的问题快速并且正确地因此没令人满意地被解决。在这篇论文，我们建议一个试探算法处理这个问题。与主要存在方法相比，我们的途径有三个不同特征。首先，它与关于网络尺寸的一粗略地线性的时间是很快的。第二，没有明确的社区结构，它与复杂网络展出一个好聚类能力和特别罐头工作很好。最后，它对它的内建的参数感觉迟钝并且不要求优先的知识。电子增补材料电子增补材料为在 http://dx.doi.org/10.1007/s11390-007-9039-1 的这篇文章是可得到的并且为授权的用户可存取。

英文摘要：

Signed network is an important kind of complex network, which includes both positive relations and negative relations. Communities of a signed network are defined as the groups of vertices, within which positive relations are dense and between which negative relations are also dense. Being able to identify communities of signed networks is helpful for analysis of such networks. Hitherto many algorithms for detecting network communities have been developed. However, most of them are designed exclusively for the networks including only positive relations and are not suitable for signed networks. So the problem of mining communities of signed networks quickly and correctly has not been solved satisfactorily. In this paper, we propose a heuristic algorithm to address this issue. Compared with major existing methods, our approach has three distinct features. First, it is very fast with a roughly linear time with respect to network size. Second, it exhibits a good clustering capability and especially can work well with complex networks without well-defined community structures. Finally, it is insensitive to its built-in parameters and requires no prior knowledge.