快速搜索最稠密子图与基于局部最优性的分解
Fast Searching The Densest Subgraph And Decomposition With Local Optimality
AI总结:
本文针对最稠密子图问题中迭代算法收敛振荡的问题,提出局部最优权重分布算法LOWD实现单调收敛,并结合改进计数排序剪枝图以加速搜索。
摘要:
最稠密子图问题(DSP)是一个重要的基础问题,具有广泛的应用,包括欺诈检测、社区发现和DNA基序发现。基于边的密度是DSP中最常用的度量之一。尽管最大流算法可以在多项式时间内精确求解该问题,但不断增长的数据量和算法的高复杂度促使科学家寻找近似算法。其中,线性规划的对偶性衍生出若干迭代算法,包括Greedy++、Frank-Wolfe和FISTA,这些算法通过重新分配边权重来寻找最稠密子图,但这些迭代算法会在最优解附近振荡,无法满足快速收敛的要求。我们提出主要算法局部最优权重分布(LOWD),以局部最优操作分配剩余边权重,从而单调收敛到最优解。理论上,我们证明该算法将达到一种特定线性规划的最优状态,该线性规划被称为局部稠密分解。此外,我们证明无需考虑原图中的大多数边。因此,我们开发了一种剪枝算法,使用改进的计数排序通过移除不必要的边和节点来剪枝图,然后可以在小得多的图中搜索最稠密子图。
英文摘要:
Densest Subgraph Problem (DSP) is an important primitive problem with a wide range of applications, including fraud detection, community detection and DNA motif discovery. Edge-based density is one of the most common metrics in DSP. Although a maximum flow algorithm can exactly solve it in polynomial time, the increasing amount of data and the high complexity of algorithms motivate scientists to find approximation algorithms. Among these, its duality of linear programming derives several iterative algorithms including Greedy++, Frank-Wolfe and FISTA which redistribute edge weights to find the densest subgraph, however, these iterative algorithms vibrate around the optimal solution, which are not satisfactory for fast convergence. We propose our main algorithm Locally Optimal Weight Distribution (LOWD) to distribute the remaining edge weights in a locally optimal operation to converge to the optimal solution monotonically. Theoretically, we show that it will reach the optimal state of a specific linear programming which is called locally-dense decomposition. Besides, we show that it is not necessary to consider most of the edges in the original graph. Therefore, we develop a pruning algorithm using a modified Counting Sort to prune graphs by removing unnecessary edges and nodes, and then we can search the densest subgraph in a much smaller graph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。