A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
DOI10.1007/S11336-011-9221-9zbMATH Open1231.62204OpenAlexW2008360964WikidataQ39494550 ScholiaQ39494550MaRDI QIDQ658141FDOQ658141
Authors: Douglas Steinley, Michael J. Brusco 
Publication date: 11 January 2012
Published in: Psychometrika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11336-011-9221-9
Recommendations
- An Exact Algorithm for Blockmodeling of Two-Mode Network Data
- Block seriation problems: A unified approach. Reply to the problem of H. Garcia and J. M. Proth (Applied Stochastic Models and Data Analysis, 1, (1), 25–34 (1985))
- scientific article; zbMATH DE number 2034558
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- Multiobjective blockmodeling for social network analysis
Applications of statistics to social sciences (62P25) Search theory (90B40) Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30)
Cites Work
- A nonparametric view of network models and Newman–Girvan and other modularities
- Estimation and Prediction for Stochastic Blockstructures
- Title not available (Why is that?)
- Learning deep architectures for AI
- Mixed membership stochastic blockmodels
- An Exponential Family of Probability Distributions for Directed Graphs
- Title not available (Why is that?)
- Community structure in social and biological networks
- An efficient tabu search procedure for the \(p\)-median problem
- Optimization strategies for two-mode partitioning
- Indirect Blockmodeling of 3-Way Networks
- Variable neighborhood search
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- Noising methods for a clique partitioning problem
- Bandwidth Packing: A Tabu Search Approach
- Title not available (Why is that?)
- Cluster Analysis: An Application of Lagrangian Relaxation
- Title not available (Why is that?)
- Exchangeable Rasch matrices
- Conditions for eliminating intransitivities in binary digraphs†
- Title not available (Why is that?)
- An interactive multiobjective programming approach to combinatorial data analysis
- A dynamic model for social networks†
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- The tunneling method for global optimization in multidimensional scaling
- Title not available (Why is that?)
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence
- Partitioning Signed Two-Mode Networks
- Title not available (Why is that?)
- ON GROUP REPRESENTATIONS OVER A VALUATION RING
- Inducing a blockmodel structure of two-mode binary data using seriation procedures
- Design of hybrids for the minimum sum-of-squares clustering problem
Cited In (8)
- Multiobjective blockmodeling for social network analysis
- Optimizing transformations of structural balance in signed networks with potential relationships
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence
- Clusterwise p* models for social network analysis
- A neighborhood exploration approach with multi-start for extend generalized block-modeling
- Network structure optimization for social networks by minimizing the average path length
- An Exact Algorithm for Blockmodeling of Two-Mode Network Data
Uses Software
This page was built for publication: A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658141)
