arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.06993math.STcs.SIstat.MLstat.TH
收藏

度修正块模型中的社区检测

Community Detection in Degree-Corrected Block Models

Chao Gao, Zongming Ma, Anderson Y. Zhang, Harrison H. Zhou

摘要:

社区发现是网络数据分析的核心问题。给定一个网络,社区检测的目标是将网络节点划分为少量的集群,这通常有助于揭示有趣的结构。本文研究度校正块模型(DCBMs)中的社区发现问题。我们首先推导出在适当的条件下,错误分类比例损失问题的渐近极小极大风险。极大极小风险取决于度校正参数,社区规模,平均内和社区之间的连接在一个直观的和可解释的方式。此外,我们提出了一个多项式时间算法自适应执行一致的,甚至渐近最优的社区检测DCBM。

英文摘要:

Community detection is a central problem of network data analysis. Given a network, the goal of community detection is to partition the network nodes into a small number of clusters, which could often help reveal interesting structures. The present paper studies community detection in Degree-Corrected Block Models (DCBMs). We first derive asymptotic minimax risks of the problem for a misclassification proportion loss under appropriate conditions. The minimax risks are shown to depend on degree-correction parameters, community sizes, and average within and between community connectivities in an intuitive and interpretable way. In addition, we propose a polynomial time algorithm to adaptively perform consistent and even asymptotically optimal community detection in DCBMs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑