Constructing blockmodels: how and why

DOI10.1016/0022-2496(78)90034-2zbMath0375.92001OpenAlexW2066548809MaRDI QIDQ1245783

Phipps Arabie

Publication date: 1978

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-2496(78)90034-2

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to biology (92-02) Mathematical psychology (91E99)

Related Items

Goodness-of-fit test for latent block models, Applications of the theory of meaningfulness to psychology, Multiple Role Discovery in Complex Networks, Hierarchical classes: model and data analysis, Integer programs for one- and two-mode blockmodeling based on prespecified image matrices for structural and regular equivalence, The network matching principle: a model of efficient resource allocation by informal social networks in non-profit and other non-market social structures, Variational algorithms for biclustering models, Two-mode clustering methods: astructuredoverview, Correspondence and canonical analysis of relational data, Deep two-way matrix reordering for relational data analysis, A factorization procedure for finite algebras, The analysis of semigroups of multirelational systems, A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices, 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)), The role assignment model nearly fits most social networks, Two-generator semigroups of binary relations, Profile likelihood biclustering, Detection of structurally homogeneous subsets in graphs, Blockmodels with maximum concentration., Overlapping communities and roles in networks with node attributes: probabilistic graphical modeling, Bayesian formulation and variational inference, Additive clustering and qualitative factor analysis methods for similarity matrices, The relative fit measure for evaluating a blockmodel, COBLOC: A hierarchical method for blocking network data, Equivalence in a social network, A mathematical analysis of a natural class of partitions of a graph, An Exact Algorithm for Blockmodeling of Two-Mode Network Data, Statistical analysis of binary relational data: Parameter estimation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics on spaces of finite trees
• Representation of structure in similarity data: problems and prospects
• An exact probability distribution on the connectivity of random graphs
• Some applications of graph theory to clustering
• On measures of information and their characterizations
• Spatial, non-spatial and hybrid models for scaling
• Probabilities of homomorphic mappings from multiple graphs
• Hierarchical clustering schemes
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
• Composite measurement
• Incidence matrices, interval graphs and seriation in archeology
• Measurement of the distance between distinct partitions of a finite set of objects
• Monotone invariant clustering procedures
• A desirable form for sparse matrices when computing their inverse in factored forms
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Nonmetric multidimensional scaling. A numerical method
• Theory of equivalence relations
• Some Simple Applications of the Travelling Salesman Problem
• Printer graphics for clustering
• SERIATION USING ASYMMETRIC PROXIMITY MEASURES
• A Graph-Theoretic Approach to Goodness-of-Fit in Complete-Link Hierarchical Clustering
• Computational complexity of operations involving perfect elimination sparse matrices
• Clustering representations of group overlap†
• A dynamic model for social networks†
• Hierarchical partition—a new optimal pivoting algorithm
• Informational optima in a formal hierarchy: Calculations using the semigroup†
• The structural implications of measurement error in sociometry†
• 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
• Technical Note—Clustering a Data Array and the Traveling-Salesman Problem
• Development of structure in a society with a dominance relation when new members are added successively
• Partitioning and Tearing Systems of Equations
• The Approximation of Fixed Points of a Continuous Mapping
• A sparse matrix scheme for the computer analysis of structures
• Projection Methods for Solving Sparse Linear Systems
• The Decomposition of Economic Production Systems
• Analysis of the Diagonal Pivoting Method
• Abundance matrices and seriation in archaeology
• An Ordering Algorithm for Analysis of Data Arrays
• Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
• Problem Decomposition and Data Reorganization by a Clustering Technique