<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>Deterministic blockmodeling of a two-mode binary network matrix based on structural equivalence is a well-known problem in the social network literature. Whether implemented in a standalone fashion, or embedded within a metaheuristic framework, a popular relocation heuristic (RH) has served as the principal solution tool for this problem. In this paper, we establish that a two-mode <italic>KL</italic>-median heuristic (TMKLMedH) seeks to optimize the same criterion as the RH for deterministic blockmodeling. The TMKLMedH runs much faster than the RH, so many more restarts of the TMKLMedH can be accomplished when the two methods are constrained to the same time limit. Three computational comparisons of RH and TMKLMedH were conducted using both synthetic and real-world networks. In all three comparisons, the superiority of TMKLMedH was unequivocal.</p>
</abstract>

Deterministic blockmodeling of a two-mode binary network matrix based on structural equivalence is a well-known problem in the social network literature. Whether implemented in a standalone fashion, or embedded within a metaheuristic framework, a popular relocation heuristic (RH) has served as the principal solution tool for this problem. In this paper, we establish that a two-mode KL-median heuristic (TMKLMedH) seeks to optimize the same criterion as the RH for deterministic blockmodeling. The TMKLMedH runs much faster than the RH, so many more restarts of the TMKLMedH can be accomplished when the two methods are constrained to the same time limit. Three computational comparisons of RH and TMKLMedH were conducted using both synthetic and real-world networks. In all three comparisons, the superiority of TMKLMedH was unequivocal.

Deterministic Blockmodeling of Two-Mode Binary Networks Using a Two-Mode <italic>KL</italic>-Median Heuristic

Journal of Social Structure

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Deterministic Blockmodeling of Two-Mode Binary Networks Using a Two-Mode -Median Heuristic

Deterministic blockmodeling of a two-mode binary network matrix based on structural equivalence is a well-known problem in the social network literature....

Deterministic Blockmodeling of Two-Mode Binary Networks Using a Two-Mode KL-Median Heuristic

Published Online: Sep 27, 2018

Page range: 1 - 22

DOI: https://doi.org/10.21307/joss-2018-007

Keywords
Deterministic blockmodeling, Heuristics, Two-mode networks

© 2018 Michael Brusco et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Deterministic Blockmodeling of Two-Mode Binary Networks Using a Two-Mode KL-Median Heuristic

Published Online: Sep 27, 2018

Page range: 1 - 22

DOI: https://doi.org/10.21307/joss-2018-007

KeywordsDeterministic blockmodeling, Heuristics, Two-mode networks

© 2018 Michael Brusco et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Keywords
Deterministic blockmodeling, Heuristics, Two-mode networks