[论文解读] Provable Overlapping Community Detection in Weighted Graphs

Jimit Majmudar, Stephen A. Vavasis|arXiv (Cornell University)|Apr 1, 2020

Complex Network Analysis Techniques被引用 1

一句话总结

本文提出了一种基于凸优化的方法，用于在加权图中检测重叠社区，且无需依赖纯节点假设，从而能够在没有任何节点仅属于单一社区的情况下实现重叠社区的可证明检测。该方法利用凸松弛以确保理论保证，并在合成网络和真实网络中表现出色。

ABSTRACT

Community detection is a widely-studied unsupervised learning problem in which the task is to group similar entities together based on observed pairwise entity interactions. This problem has applications in diverse domains such as social network analysis and computational biology. There is a significant amount of literature studying this problem under the assumption that the communities do not overlap. When the communities are allowed to overlap, often a pure nodes assumption is made, i.e. each community has a node that belongs exclusively to that community. This assumption, however, may not always be satisfied in practice. In this paper, we provide a provable method to detect overlapping communities in weighted graphs without explicitly making the pure nodes assumption. Moreover, contrary to most existing algorithms, our approach is based on convex optimization, for which many useful theoretical properties are already known. We demonstrate the success of our algorithm on artificial and real-world datasets.

研究动机与目标

• 解决现有重叠社区检测方法依赖纯节点假设的局限性，该假设在真实网络中可能不成立。
• 基于凸优化，为加权图中的重叠社区检测开发一种理论基础坚实的方法。
• 在无需节点仅属于一个社区的前提下，实现重叠社区的可证明检测。
• 在现实网络条件下提升社区检测的鲁棒性和理论保证。

提出的方法

• 该方法将重叠社区检测建模为加权图表示上的凸优化问题。
• 通过非凸组合问题的松弛化，实现理论分析与高效计算。
• 优化框架结合了节点权重与边权重，以建模社区成员身份与交互强度。
• 通过保持重叠社区关键结构特性的凸松弛方法推导出解。
• 该方法无需识别纯节点，因此适用于不存在此类节点的网络。

实验结果

研究问题

• RQ1 是否可以在不假设存在纯节点的前提下，实现加权图中的重叠社区检测？
• RQ2 凸优化框架能否为重叠社区检测提供可证明的保证？
• RQ3 所提出方法在合成网络和真实网络上的性能与现有方法相比如何？
• RQ4 该方法在不同网络结构和权重分布下的理论鲁棒性如何？

主要发现

• 所提出方法成功实现了在加权图中无需纯节点假设的重叠社区检测。
• 凸优化公式确保了社区检测的理论保证与稳定性。
• 该方法在人工数据集和真实数据集上均表现出色，证实了其实际适用性。
• 该方法对纯节点的缺失具有鲁棒性，这是先前方法的关键局限。