Correspondence analysis and optimal structural representations
We consider the task of optimally constructing the proximity matrices characterizing the partitions (under suitable restriction) so as to maximize the cross-product measure, or equivalently, the Pearson correlation between their entries. The major result presented states that within the broad classes of matrices that are either symmetric, skew- symmetric, or completely arbitrary, optimal representations are already derivable from what is given by a simple one-dimensional correspondence analysis solution. Besides severely limiting the type of structures that might be of interest to consider for representing the proximity matrices, this result also implies that correspondence analysis beyond one dimension must always be justified from logical bases other than the optimization of a single correlational relationship between the matrices representing the two partitions.
- scientific article; zbMATH DE number 3885093 (Why is no real title available?)
- scientific article; zbMATH DE number 3942813 (Why is no real title available?)
- scientific article; zbMATH DE number 4022343 (Why is no real title available?)
- scientific article; zbMATH DE number 4076355 (Why is no real title available?)
- scientific article; zbMATH DE number 3766832 (Why is no real title available?)
- scientific article; zbMATH DE number 3466361 (Why is no real title available?)
- Measures of Association for Cross Classifications
- On the quantification of qualitative data from the mathematico- statistical point of view. (An approach for applying this method to the Parole Prediction.)
- Was Euclid an unnecessarily sophisticated psychologist?
- Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures
- Inverse correspondence analysis
- Graph-theoretic representations for proximity matrices through strongly-anti-Robinson or circular strongly-anti-Robinson matrices
- A conjunctive parallelogram model for Pick any/\(n\) data
- Optimal least-squares unidimensional scaling: improved branch-and-bound procedures and comparison to dynamic programming
- A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
- A note on the estimation of the Pareto efficient set for multiobjective matrix permutation problems
- Structural model correlation using large admissible perturbations incognate space
- Comparing three partitions: an inferential approach based on multi-way contingency tables
- scientific article; zbMATH DE number 1750179 (Why is no real title available?)
- Gleaning in the field of dual scaling
- Probability matrix decomposition models
This page was built for publication: Correspondence analysis and optimal structural representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1205771)