An Exact Algorithm for Blockmodeling of Two-Mode Network Data

DOI10.1080/0022250X.2011.597278MaRDI QIDQ2857671zbMATH OpenOpenAlexWikidataFDO

Authors Michael J. Brusco, Patrick Doreian, Andrej Mrvar, Douglas Steinley

Publication date 5 November 2013

Published in The Journal of Mathematical Sociology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0022250x.2011.597278

zbMATH Keywords

branch-and-boundexact algorithmsgeneralized blockmodelingsocial networkstwo-mode networks

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Social networks; opinion dynamics (91D30)

Recommendations

• A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
• Block matrix models for dynamic networks
• Two-mode network autoregressive model for large-scale networks
• Direct and Indirect Approaches to Blockmodeling of Valued Networks in Terms of Regular Equivalence
• A FastMap-based algorithm for block modeling
• Mixture models and networks: The stochastic blockmodel
• Dynamic degree-corrected blockmodels for social networks: A nonparametric approach
• Hurdle Blockmodels for Sparse Network Modeling
• Exact Recovery in the Stochastic Block Model
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure

Cites work

• A Branch and Bound Clustering Algorithm
• A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
• A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning
• A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Cluster analysis and mathematical programming
• Computational study of large-scale p-median problems
• Constructing blockmodels: how and why
• Evaluation of a Branch and Bound Algorithm for Clustering
• Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
• scientific article; zbMATH DE number 3942804 (Why is no real title available?)
• scientific article; zbMATH DE number 976357 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 2231543 (Why is no real title available?)
• scientific article; zbMATH DE number 4189544 (Why is no real title available?)
• Inducing a blockmodel structure of two-mode binary data using seriation procedures
• Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence
• Optimization by simulated annealing
• Optimization strategies for two-mode partitioning
• Partitioning Signed Two-Mode Networks
• Tabu Search—Part I
• Tabu Search—Part II
• Variable neighborhood search

Cited in

(9)

• A neighborhood exploration approach with multi-start for extend generalized block-modeling
• Two-mode network autoregressive model for large-scale networks
• Multiobjective blockmodeling for social network analysis
• A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
• Evaluating the quality of image matrices in blockmodeling
• An exact algorithm for the two-mode \(KL\)-means partitioning problem
• Deterministic blockmodelling of signed and two‐mode networks: A tutorial with software and psychological examples
• A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
• Inducing a blockmodel structure of two-mode binary data using seriation procedures

This page was built for publication: An Exact Algorithm for Blockmodeling of Two-Mode Network Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857671)