The following pages link to Combinatorial Data Analysis (Q2723176):
Displayed 37 items.
- Classification of asymmetric proximity data (Q269175) (← links)
- A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices (Q463122) (← links)
- Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis (Q477965) (← links)
- A structural characterization for certifying Robinsonian matrices (Q529005) (← links)
- A review of multiobjective programming and its application in quantitative psychology (Q645494) (← links)
- Inducing a blockmodel structure of two-mode binary data using seriation procedures (Q856645) (← links)
- Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← links)
- Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal (Q998835) (← links)
- Three-mode partitioning (Q1010515) (← links)
- An experimental comparison of seriation methods for one-mode two-way data (Q1752777) (← links)
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices (Q1754256) (← links)
- Conjunctive prediction of an ordinal criterion variable on the basis of binary predictors (Q1766746) (← links)
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices (Q1775813) (← links)
- Identifying a reordering of rows and columns for multiple proximity matrices using multiobjective programming (Q1868100) (← links)
- A continuous rating method for preferential voting: the complete case (Q1926601) (← links)
- Seriation using tree-penalized path length (Q2098032) (← links)
- The weighted sitting closer to friends than enemies problem in the line (Q2099388) (← links)
- Disentangling relationships in symptom networks using matrix permutation methods (Q2141642) (← links)
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming (Q2260052) (← links)
- Taxicab correspondence analysis (Q2261028) (← links)
- An academic genealogy of psychometric society presidents (Q2331183) (← links)
- A multi-scale seriation algorithm for clustering sparse imbalanced data: application to spike sorting (Q2337510) (← links)
- An improved exact algorithm for least-squares unidimensional scaling (Q2375707) (← links)
- Representation of individual differences in rectangular proximity data through anti-Q matrix decomposition (Q2445688) (← links)
- Exact solution procedures for the balanced unidirectional cyclic layout problem (Q2482739) (← links)
- ConPar: a method for identifying groups of concordant subject proximity matrices for subsequent multidimensional scaling analyses (Q2483823) (← links)
- Compact integer-programming models for extracting subsets of stimuli from confusion matrices (Q2511847) (← links)
- Validating clusters with the lower bound for sum-of-squares error (Q2517864) (← links)
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning (Q2517895) (← links)
- Computing exact clustering posteriors with subset convolution (Q2815984) (← links)
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems (Q2905131) (← links)
- Affinity propagation: An exemplar‐based tool for clustering in psychological research (Q4627522) (← links)
- Clustering Objects on Subsets of Attributes (with Discussion) (Q4670795) (← links)
- Seriation and matrix reordering methods: An historical overview (Q4969706) (← links)
- An integrated dominance analysis and dynamic programing approach for measuring predictor importance for customer satisfaction (Q5077898) (← links)
- Residual analysis for unidimensional scaling in the <i>L</i><sub>2</sub>-norm (Q5087499) (← links)
- A New Tractable Case of the QAP with a Robinson Matrix (Q5743542) (← links)