Direct blockmodeling of valued and binary networks: a dichotomization-free approach
Carl Nordlund

TL;DR
This paper introduces a novel direct blockmodeling method for valued and binary networks that avoids data dichotomization, using an adaptive weighted correlation criterion, enhancing interpretability and applicability.
Contribution
It presents a new approach that bypasses the need for dichotomizing valued networks, allowing direct analysis with conventional ideal blocks without data transformation.
Findings
Effective application to both binary and valued networks
Produces feasible and intuitive solutions in diverse examples
Offers a practical alternative to traditional dichotomization methods
Abstract
A long-standing open problem with direct blockmodeling is that it is explicitly intended for binary, not valued, networks. The underlying dilemma is how empirical valued blocks can be compared with ideal binary blocks, an intrinsic problem in the direct approach where partitions are solely determined through such comparisons. Addressing this dilemma, valued networks have either been dichotomized into binary versions, or novel types of ideal valued blocks have been introduced. Both these workarounds are problematic in terms of interpretability, unwanted data reduction, and the often arbitrary setting of model parameters. This paper proposes a direct blockmodeling approach that effectively bypasses the dilemma with blockmodeling of valued networks. By introducing an adaptive weighted correlation-based criteria function, the proposed approach is directly applicable to both binary and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
