Taxicab correspondence analysis

DOI10.1007/s11336-004-1231-4zbMath1306.62396OpenAlexW2057057383WikidataQ89276368 ScholiaQ89276368MaRDI QIDQ2261028

Vartan 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)

Related Items (5)

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 contingency tables with one heavy weight column ⋮ Some new aspects of taxicab correspondence analysis

Uses Software

• AS 136

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithm AS 136: A K-Means Clustering Algorithm
• A branch-and-bound algorithm for fitting anti-Robinson structures to symmetric dissimilarity matrices
• Improving dynamic programming strategies for partitioning
• Combinatorial Data Analysis
• On Grouping for Maximum Homogeneity
• Regressions by Leaps and Bounds
• A branch search algorithm for maximum likelihood paired comparison ranking
• A Branch and Bound Clustering Algorithm
• A Branch and Bound Algorithm for Feature Subset Selection
• A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
• An Interior Point Algorithm for Minimum Sum-of-Squares Clustering
• Evaluation of a Branch and Bound Algorithm for Clustering
• A Dynamic Programming Algorithm for Cluster Analysis
• Cluster Analysis and Mathematical Programming
• A branch and bound algorithm for maximum likelihood paired comparison ranking

This page was built for publication: Taxicab correspondence analysis