A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
From MaRDI portal
Publication:658141
DOI10.1007/s11336-011-9221-9zbMath1231.62204OpenAlexW2008360964WikidataQ39494550 ScholiaQ39494550MaRDI QIDQ658141
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
Clustering in the social and behavioral sciences (91C20) Social networks; opinion dynamics (91D30) Applications of statistics to social sciences (62P25) Search theory (90B40)
Related Items (5)
Optimizing transformations of structural balance in signed networks with potential relationships ⋮ Network structure optimization for social networks by minimizing the average path length ⋮ Multiobjective blockmodeling for social network analysis ⋮ A neighborhood exploration approach with multi-start for extend generalized block-modeling ⋮ Clusterwise p* models for social network analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization strategies for two-mode partitioning
- The tunneling method for global optimization in multidimensional scaling
- Inducing a blockmodel structure of two-mode binary data using seriation procedures
- Design of hybrids for the minimum sum-of-squares clustering problem
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- An efficient tabu search procedure for the \(p\)-median problem
- Variable neighborhood search
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- Noising methods for a clique partitioning problem
- An interactive multiobjective programming approach to combinatorial data analysis
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence
- A nonparametric view of network models and Newman–Girvan and other modularities
- Mixed membership stochastic blockmodels
- Cluster Analysis: An Application of Lagrangian Relaxation
- Partitioning Signed Two-Mode Networks
- Learning Deep Architectures for AI
- An Exponential Family of Probability Distributions for Directed Graphs
- Conditions for eliminating intransitivities in binary digraphs†
- A dynamic model for social networks†
- Bandwidth Packing: A Tabu Search Approach
- Estimation and Prediction for Stochastic Blockstructures
- Community structure in social and biological networks
- Indirect Blockmodeling of 3-Way Networks
- ON GROUP REPRESENTATIONS OVER A VALUATION RING
This page was built for publication: A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
