Taxicab correspondence analysis

DOI10.1007/S11336-004-1231-4MaRDI QIDQ2261028zbMATH OpenOpenAlexWikidataFDO

Authors V. Choulakian

Publication date 6 March 2015

Published in Psychometrika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11336-004-1231-4

zbMATH Keywords

robustnesssingular value decompositioncorrespondence analysis\(L_1\) normBenzécri et al.'s measure of influence

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Applications of statistics to psychology (62P15)

Recommendations

• Multiple taxicab correspondence analysis
• Some new aspects of taxicab correspondence analysis
• Taxicab correspondence analysis of ratings and rankings
• Taxicab correspondence analysis of contingency tables with one heavy weight column
• scientific article; zbMATH DE number 4104204
• Korrespondenzanalyse
• Graph partitioning by correspondence analysis and taxicab correspondence analysis

Cites work

• scientific article; zbMATH DE number 3942804 (Why is no real title available?)
• scientific article; zbMATH DE number 3678973 (Why is no real title available?)
• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• scientific article; zbMATH DE number 976357 (Why is no real title available?)
• scientific article; zbMATH DE number 1107546 (Why is no real title available?)
• scientific article; zbMATH DE number 1107550 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• scientific article; zbMATH DE number 2231543 (Why is no real title available?)
• scientific article; zbMATH DE number 4189544 (Why is no real title available?)
• A Branch and Bound Algorithm for Feature Subset Selection
• A Branch and Bound Clustering Algorithm
• A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
• A Dynamic Programming Algorithm for Cluster Analysis
• A branch and bound algorithm for maximum likelihood paired comparison ranking
• A branch search algorithm for maximum likelihood paired comparison ranking
• A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
• Algorithm AS 136: A K-Means Clustering Algorithm
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Cluster Analysis and Mathematical Programming
• Combinatorial data analysis. Optimization by dynamic programming
• Evaluation of a Branch and Bound Algorithm for Clustering
• Improving dynamic programming strategies for partitioning
• On Grouping for Maximum Homogeneity
• Regressions by Leaps and Bounds

Cited in

(6)

• Some new aspects of taxicab correspondence analysis
• Graph partitioning by correspondence analysis and taxicab correspondence analysis
• Metrics of \(L_{p}\)-type and distributional equivalence principle
• Multiple taxicab correspondence analysis
• Taxicab correspondence analysis of ratings and rankings
• Taxicab correspondence analysis of contingency tables with one heavy weight column

Describes a project that uses

Uses Software

• AS 136

This page was built for publication: Taxicab correspondence analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2261028)