A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
From MaRDI portal
Publication:2462311
Recommendations
- An Exact Algorithm for Blockmodeling of Two-Mode Network Data
- A tabu-search heuristic for deterministic two-mode blockmodeling of binary network matrices
- Multiobjective blockmodeling for social network analysis
- Optimization strategies for two-mode partitioning
- Inducing a blockmodel structure of two-mode binary data using seriation procedures
Cites work
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- A conjunctive parallelogram model for Pick any/\(n\) data
- A permutation-translation simulated annealing algorithm for \(L_{1}\) and \(L_{2}\) unidimensional scaling
- A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
- Additive two-mode clustering: The error-variance approach revisited
- Constructing blockmodels: how and why
- Design of hybrids for the minimum sum-of-squares clustering problem
- Estimating the dimension of a model
- scientific article; zbMATH DE number 5280182 (Why is no real title available?)
- scientific article; zbMATH DE number 3678973 (Why is no real title available?)
- scientific article; zbMATH DE number 3521374 (Why is no real title available?)
- scientific article; zbMATH DE number 1008448 (Why is no real title available?)
- scientific article; zbMATH DE number 1107548 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- scientific article; zbMATH DE number 3345350 (Why is no real title available?)
- Incidence matrices, interval graphs and seriation in archeology
- Inducing a blockmodel structure of two-mode binary data using seriation procedures
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
- On the performance of simulated annealing for large-scale \(L_{2}\) unidimensional scaling
- Optimization strategies for two-mode partitioning
- Problem Decomposition and Data Reorganization by a Clustering Technique
- Two-mode clustering methods: astructuredoverview
- Variable Neighborhood Search
- Variable neighborhood search
Cited in
(14)- Variable neighbourhood search: Methods and applications
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
- A neighborhood exploration approach with multi-start for extend generalized block-modeling
- Multiobjective blockmodeling for social network analysis
- 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
- An Exact Algorithm for Blockmodeling of Two-Mode Network Data
- Partitioning Signed Two-Mode Networks
- Clusterwise p* models for social network analysis
- An exact algorithm for the two-mode \(KL\)-means partitioning problem
- 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
- Selection of variables in cluster analysis: An empirical comparison of eight procedures
- Variable neighbourhood search: methods and applications
This page was built for publication: A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2462311)
