scientific article
From MaRDI portal
Publication:3765005
zbMath0628.62003MaRDI QIDQ3765005
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
randomizationmatchingproximityclosenesssignificance testinglinear assignment modelcomparing rectangular data matriceshigher-order assignment indicesindices of correspondencemultiple proximity matricesquadratic assignment models
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Research exposition (monographs, survey articles) pertaining to statistics (62-02) Nonparametric inference (62G99)
Related Items (36)
A multi-parent genetic algorithm for the quadratic assignment problem ⋮ On the validity of perceived social structure ⋮ Points of view analysis revisited: Fitting multidimensional structures to optimal distance components with cluster restrictions on the variables ⋮ The rowwise correlation between two proximity matrices and the partial rowwise correlation ⋮ Disentangling relationships in symptom networks using matrix permutation methods ⋮ Probabilistic models in cluster analysis ⋮ A tutorial on methods for the modeling and analysis of social network data ⋮ A survey for the quadratic assignment problem ⋮ Some simple algorithms for structural comparison ⋮ Unnamed Item ⋮ Fitting a distance model to homogeneous subsets of variables: Points of view analysis of categorical data ⋮ Exact moments of the symmetric cubic assignment statistic ⋮ A parallel water flow algorithm with local search for solving the quadratic assignment problem ⋮ A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices ⋮ A brief history of balance through time ⋮ Intersections of hypergraphs ⋮ Optimal partitioning of a data set based on the \(p\)-median model ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ New special cases of the quadratic assignment problem with diagonally structured coefficient matrices ⋮ Identifying genuine clusters in a classification ⋮ An algorithm to maximize the agreement between partitions ⋮ Correspondence analysis and optimal structural representations ⋮ ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses ⋮ A New Tractable Case of the QAP with a Robinson Matrix ⋮ Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices ⋮ Statistical significance of the contribution of variables to the PCA solution: an alternative permutation strategy ⋮ Evaluation of the multiobjective ant colony algorithm performances on biobjective quadratic assignment problems ⋮ Compact integer-programming models for extracting subsets of stimuli from confusion matrices ⋮ A binary integer program to maximize the agreement between partitions ⋮ Sensitivity of MRQAP tests to collinearity and autocorrelation conditions ⋮ Combinatorial individual differences scaling within the city-block metric ⋮ Brand diagnostics: Mapping branding effects using consumer associative networks ⋮ A unified approach to simple special cases of extremal permutation problems ⋮ Statistical evaluation of algebraic constraints for social networks ⋮ Nonparametric inference for network data ⋮ Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
This page was built for publication:
