Backend
Dual-Corrected Stochastic Block Model ($\text{DC}^2\text{SBM}$): A Generalized Structure Detection Method for Attributed Networks
arXiv stat.ML0 views
arXiv:2610.40676v1 Announce Type: cross Abstract: Community detection in attributed networks is one of the core tasks of complex network analysis. The stochastic block model (SBM) and its variants are able to detect generalized network structures such as assortative, disassortative and mixed structures. However, existing generative methods either ignore node heterogeneity, or characterize node activity in the topological and attribute dimensions by one and the same factor, making it difficult to correctly model node activity when the two kinds of activity are decoupled. In this paper, we propose the Dual-Corrected Stochastic Block Model ($\text{DC}^2\text{SBM}$), which introduces independent correction factors---a topological degree factor and an attribute abundance factor---into the link-generation and attribute-generation channels, respectively, thereby effectively decoupling node activity from membership inference, and which further introduces a global scaling parameter to resolve the mismatch between the normalization constraints and the network scale. The model is inferred by the expectation--maximization (EM) algorithm, and the newly introduced factors cancel out completely in the posterior computation, so that no additional computational cost is incurred. Experiments on synthetic and real attributed networks show that DC^2SBM outperforms state-of-the-art methods in community detection accuracy, with an especially pronounced advantage when the topological signal is weak. The two correction factors can be recovered independently from their respective channels without cross-talk. Analytical as well as controlled experiments further demonstrate that modeling with a single shared factor fails when the two kinds of activity are decoupled---a regime that is prevalent in real networks---thereby validating the necessity of dual independent correction.
Source:https://arxiv.org/abs/2610.40676PreviousRegret-Optimal Wasserstein-Robust Linear RegressionNextCertified Behavioral Retention for Continual Adaptation with Held-Out Anchors
Related posts
Turn Today’s Messy Notes Into Tomorrow’s Checklist With AI
0dev.to AI
A 763B MoE at "2 Bits": Where the Bytes Really Go in the GSQ-RCO GGUFs, and Why 100% Recovery Sits Inside the Noise
0dev.to AI
How I ship fixes to open-source projects maintainers actually merge (with AI in the loop)
0dev.to AI
Prompt Injection Through Documents: How to Harden an LLM Extraction Pipeline
0dev.to AI
Keeping noindex, the sitemap and the image sitemap in agreement for programmatic pages
0dev.to AI
3 Things in AI You Should Know: Character.AI Files for Bankruptcy
0dev.to AI