[论文解读] Matrix Factorization Framework for Community Detection under the Degree-Corrected Block Model

A. Daché, Arnaud Vandaele+1 more|arXiv (Cornell University)|Jan 9, 2026

Complex Network Analysis Techniques被引用 0

一句话总结

本论文将带度修正分块模型(DCBM)下的推断重新表述为一个约束的非负矩阵分解问题， 引入带有FROST的OtrisymNMF以实现高效推断，并通过可分离NMF(SVCA)的鲁棒初始化来改进结果与速度。

ABSTRACT

Community detection is a fundamental task in data analysis. Block models form a standard approach to partition nodes according to a graph model, facilitating the analysis and interpretation of the network structure. By grouping nodes with similar connection patterns, they enable the identification of a wide variety of underlying structures. The degree-corrected block model (DCBM) is an established model that accounts for the heterogeneity of node degrees. However, existing inference methods for the DCBM are heuristics that are highly sensitive to initialization, typically done randomly. In this work, we show that DCBM inference can be reformulated as a constrained nonnegative matrix factorization problem. Leveraging this insight, we propose a novel method for community detection and a theoretically well-grounded initialization strategy that provides an initial estimate of communities for inference algorithms. Our approach is agnostic to any specific network structure and applies to graphs with any structure representable by a DCBM, not only assortative ones. Experiments on synthetic and real benchmark networks show that our method detects communities comparable to those found by DCBM inference, while scaling linearly with the number of edges and communities; for instance, it processes a graph with 100,000 nodes and 2,000,000 edges in approximately 4 minutes. Moreover, the proposed initialization strategy significantly improves solution quality and reduces the number of iterations required by all tested inference algorithms. Overall, this work provides a scalable and robust framework for community detection and highlights the benefits of a matrix-factorization perspective for the DCBM.

研究动机与目标

• 通过带度修正的分块模型(DCBM)来动机化并解决图社区中的度异质性问题。
• 将DCBM推断重新表述为具有矩阵三因子分解视角的约束非负矩阵分解问题。
• 提出OtrisymNMF(FROST)，利用Frobenius范数实现可扩展、鲁棒的社区检测。
• 开发基于可分离NMF的初始化(SVCA)，为推断提供强初始点。
• 在合成网络与真实网络上展示相对于基于DCBM的方法的竞争精度与更快的速度。

提出的方法

• 将DCBM推断重新表述为约束非负矩阵三因子分解：最小化 d(A, ZθZ^T) 其中 Z^T Z = I 且 θ^T = θ，Z, θ ≥ 0。
• 用Frobenius范数替代KL散度（泊松基似然）以获得OtrisymNMF模型：min_{Z, θ} ||A − ZθZ^T||_F^2，Z^T Z = I，θ^T = θ，Z, θ ≥ 0。
• 引入FROST（FRobenius Orthogonal Symmetric Trifactorization）作为交替优化算法：用闭式解更新 θ 即 Z^T A Z，利用逐行一元四阶多项式子问题通过Cardano方法更新 Z。
• 利用基于可分离NMF的初始化(SVCA)鲁棒地估计 W 和 Z，然后计算 θ = Z^T A Z，为FROST和DCBM推断提供强初始点。
• 用索引向量和权重向量高效表示 Z，使每次迭代的复杂度达到 O(n r ⟨d⟩)，实现对大规模图的可扩展性。

实验结果

研究问题

• RQ1 DCBM推断是否能够在约束NUF分解框架内有效求解，且基于Frobenius的目标是否能达到与KL基似然相当或更好？
• RQ2 基于 SVCA 的可分离-NMF 初始化是否改善DCBM推断和所提OtrisymNMF方法的收敛性、准确性和速度？
• RQ3 在不假设特定图结构的前提下，带FROST的OtrisymNMF是否能检测到DCBM下的多种结构（同向、异向、混合等）？
• RQ4 所提出的初始化对合成与真实网络中的收敛性和解的质量有何影响？

主要发现

• OtrisymNMF with FROST 在社区检测表现上可与DCBM推断相当，且通常更快。
• SVCA初始化显著提高KN、KL-EM和MHA的准确性并减少迭代次数，对于许多合成情景实现了完美恢复。
• 仅使用SVCA即可提供快速、鲁棒的社区检测，在某些情形下表现完美，在较高混合参数（例如 μ 高达0.4）时也表现出色。
• 该方法对边数和社区数呈线性扩展性，处理一个拥有100,000个节点和2,000,000条边的图大约用时4分钟。
• 用Frobenius范数替代KL散度缓解了KL的一些局限性（如零概率问题），在某些条件下也能更好地揭示秩低估或稀疏性。
• FROST由于θ的闭式更新和高效的逐行Z更新而快速收敛；初始化是实现高质量解的关键。