In real-world applications, interactions between two entities can be usually represented by signed graphs, i.e., graphs containing edges with positive weight representing node attraction and edges with negative weight representing node repulsion. A relevant problem for the analysis of a graph is to find a graph clustering, i.e., a partition of its nodes into clusters such that nodes contained in the same cluster are densely connected by positive edges and sparsely connected by negative edges. In this work, we propose and engineer all the details of a memetic algorithm based on a novel multilevel approach for the problem. Experimental results show that our memetic strategy computes significantly better solutions than the current state-of-the-art.
翻译:在现实应用中,两个实体之间的互动通常可以用签名的图表来表示,即含有正重边缘的图表,代表节点吸引和负重边缘,代表节点反射。分析图表的一个相关问题是找到一个图形组合,即将两个实体的节点分成组,使同一组内的节点被正边缘紧密相连,而负边缘则很少连接。在这项工作中,我们建议并设计出基于新颖的多层次解决问题方法的数学算法的所有细节。实验结果显示,我们的模拟战略计算出比目前最先进的解决方案要好得多。