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