QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
From MaRDI portal
Publication:4128322
DOI10.1111/j.2044-8317.1976.tb00714.xzbMath0356.92027OpenAlexW1963678392MaRDI QIDQ4128322
James V. Schultz, Lawrence J. Hubert
Publication date: 1976
Published in: British Journal of Mathematical and Statistical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.2044-8317.1976.tb00714.x
Related Items
Disentangling relationships in symptom networks using matrix permutation methods ⋮ A tutorial on methods for the modeling and analysis of social network data ⋮ Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data ⋮ Sequential social network data ⋮ A survey for the quadratic assignment problem ⋮ Inducing a blockmodel structure of two-mode binary data using seriation procedures ⋮ Self-learning \(K\)-means clustering: a global optimization approach ⋮ Automatic learning of cost functions for graph edit distance ⋮ Solution methods for the balancing of jet turbines ⋮ Parallel genetic algorithms with local search ⋮ Combinatorial data analysis: Confirmatory comparisons between sets of matrices ⋮ Validity studies in clustering methodologies ⋮ Improving bipartite graph edit distance approximation using various search strategies ⋮ Density-based silhouette diagnostics for clustering methods ⋮ Generalized concordance ⋮ An empirical comparison and characterisation of nine popular clustering methods ⋮ Financial clustering in presence of dominant markets ⋮ Resampling approach for cluster model selection ⋮ A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning ⋮ A statistical model of cluster stability ⋮ The circumplex: a slightly stronger than ordinal approach. ⋮ Comparing clusterings and numbers of clusters by aggregation of calibrated clustering validity indexes ⋮ Volatility clustering in the presence of time-varying model parameters ⋮ Voting rules as statistical estimators ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ A computational approach to the evolution of competitive strategy* ⋮ Optimal partitioning of a data set based on the \(p\)-median model ⋮ The approximation of two-mode proximity matrices by sums of order-constrained matrices ⋮ An experimental comparison of seriation methods for one-mode two-way data ⋮ On asymptotic non-normality of null distributions of mrpp statistics ⋮ A survey of graph edit distance ⋮ Statistical significance of the contribution of variables to the PCA solution: an alternative permutation strategy ⋮ Combinatorial data analysis: Association and partial association ⋮ A parallel heuristic for quadratic assignment problems ⋮ The comparison and fitting of given classification schemes ⋮ An interactive multiobjective programming approach to combinatorial data analysis ⋮ Compact integer-programming models for extracting subsets of stimuli from confusion matrices ⋮ On comparing two sequences of numbers and its applications to clustering analysis ⋮ Generalized measures of association for ranked data with an application to prediction accuracy ⋮ Construction of association networks from communication in teams working on complex projects ⋮ Guided Projections for Analyzing the Structure of High-Dimensional Data ⋮ Clustering heteroskedastic time series by model-based procedures ⋮ A randomized algorithm for estimating the number of clusters ⋮ Tests of matrix structure for construct validation ⋮ A heuristic for cyclic stochastic sequencing of tasks on a drum-like storage system ⋮ Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming
This page was built for publication: QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
