Constructing blockmodels: how and why
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3179521 (Why is no real title available?)
- scientific article; zbMATH DE number 3183375 (Why is no real title available?)
- scientific article; zbMATH DE number 3520320 (Why is no real title available?)
- scientific article; zbMATH DE number 3528106 (Why is no real title available?)
- scientific article; zbMATH DE number 3528107 (Why is no real title available?)
- scientific article; zbMATH DE number 3535556 (Why is no real title available?)
- scientific article; zbMATH DE number 3553640 (Why is no real title available?)
- scientific article; zbMATH DE number 3566863 (Why is no real title available?)
- scientific article; zbMATH DE number 3453423 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3218370 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- scientific article; zbMATH DE number 3227055 (Why is no real title available?)
- scientific article; zbMATH DE number 3241098 (Why is no real title available?)
- scientific article; zbMATH DE number 3241772 (Why is no real title available?)
- scientific article; zbMATH DE number 3368076 (Why is no real title available?)
- scientific article; zbMATH DE number 3374823 (Why is no real title available?)
- scientific article; zbMATH DE number 3397368 (Why is no real title available?)
- scientific article; zbMATH DE number 3400822 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A Graph-Theoretic Approach to Goodness-of-Fit in Complete-Link Hierarchical Clustering
- A desirable form for sparse matrices when computing their inverse in factored forms
- A dynamic model for social networks†
- A sparse matrix scheme for the computer analysis of structures
- Abundance matrices and seriation in archaeology
- An Ordering Algorithm for Analysis of Data Arrays
- An exact probability distribution on the connectivity of random graphs
- Analysis of the Diagonal Pivoting Method
- Clustering representations of group overlap†
- Composite measurement
- Computational complexity of operations involving perfect elimination sparse matrices
- Development of structure in a society with a dominance relation when new members are added successively
- Hierarchical clustering schemes
- Hierarchical partition—a new optimal pivoting algorithm
- Incidence matrices, interval graphs and seriation in archeology
- Informational optima in a formal hierarchy: Calculations using the semigroup†
- Measurement of the distance between distinct partitions of a finite set of objects
- Metrics on spaces of finite trees
- Monotone invariant clustering procedures
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- Nonmetric multidimensional scaling. A numerical method
- On measures of information and their characterizations
- Partitioning and Tearing Systems of Equations
- Printer graphics for clustering
- Probabilities of homomorphic mappings from multiple graphs
- Problem Decomposition and Data Reorganization by a Clustering Technique
- Projection Methods for Solving Sparse Linear Systems
- Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
- Representation of structure in similarity data: problems and prospects
- SERIATION USING ASYMMETRIC PROXIMITY MEASURES
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- SPANNING TREES AND ASPECTS OF CLUSTERING
- Some Simple Applications of the Travelling Salesman Problem
- Some applications of graph theory to clustering
- Spatial, non-spatial and hybrid models for scaling
- Technical Note—Clustering a Data Array and the Traveling-Salesman Problem
- The Approximation of Fixed Points of a Continuous Mapping
- The Decomposition of Economic Production Systems
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- The structural implications of measurement error in sociometry†
- Theory of equivalence relations
Cited in
(27)- Two-mode clustering methods: astructuredoverview
- Two-generator semigroups of binary relations
- Goodness-of-fit test for latent block models
- COBLOC: A hierarchical method for blocking network data
- Additive clustering and qualitative factor analysis methods for similarity matrices
- The relative fit measure for evaluating a blockmodel
- Equivalence in a social network
- 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
- Correspondence and canonical analysis of relational data
- Deep two-way matrix reordering for relational data analysis
- The role assignment model nearly fits most social networks
- Profile likelihood biclustering
- Detection of structurally homogeneous subsets in graphs
- Variational algorithms for biclustering models
- A factorization procedure for finite algebras
- Hierarchical classes: model and data analysis
- 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))
- Applications of the theory of meaningfulness to psychology
- The analysis of semigroups of multirelational systems
- Overlapping communities and roles in networks with node attributes: probabilistic graphical modeling, Bayesian formulation and variational inference
- An Exact Algorithm for Blockmodeling of Two-Mode Network Data
- Multiple Role Discovery in Complex Networks
- The network matching principle: a model of efficient resource allocation by informal social networks in non-profit and other non-market social structures
- A mathematical analysis of a natural class of partitions of a graph
- Blockmodels with maximum concentration.
- Statistical analysis of binary relational data: Parameter estimation
This page was built for publication: Constructing blockmodels: how and why
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245783)
