English(EN) Exact Community Recovery in Bipartite Networks

新的谱聚类算法在二分网络中实现了精确社群恢复

作者 PulseAugur 编辑部 · [1 个来源] · 2026-09-14 04:00

研究人员开发了一种能够精确恢复二分网络中社群的谱聚类算法。该算法基于删除对角线后的Gram矩阵，在温和的条件下，即使在社群规模不平衡或度数异质的情况下，也能提供精确恢复的理论保证。该方法对度数修正的随机共块模型也有效，通过算法的行归一化版本保持了其恢复保证。实验结果证实了理论发现。 AI

影响增强了分析复杂网络数据的基础方法，可能改进推荐系统和社交网络分析。

排序理由关于二分网络社群检测新算法的学术论文。[lever_c_demoted from research: ic=1 ai=0.7]

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 16 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 关于二分网络社群检测新算法的学术论文。[lever_c_demoted from research: ic=1 ai=0.7]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: Breaking (< 6h); Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

完整方法见我们的编辑标准。

arXiv stat.ML TIER_1 English(EN) · Huan Qing · 2026-09-14 04:00

二分网络中的精确社区恢复

arXiv:2609.12445v1 Announce Type: cross Abstract: Community detection in bipartite networks is a fundamental problem in modern data analysis, with applications in recommendation systems, biological networks, and social network analysis. Unlike conventional unipartite graphs, bipa…