2 citations · 2 across the 4 of their papers we have counts for
4 papers
Binary Trees and Taxicab Correspondence Analysis of Extremely Sparse Binary Textual Data: A Case Study
Vartan Choulakian, Jacques Allard, Ron Kenett
This is a case study, where Taxicab Correspondence Analysis reveals that the underlying structure of an extremely sparse binary textual data set can be represented by a binary tree…
Visualization of Extremely Sparse Contingency Table by Taxicab Correspondence Analysis: A Case Study of Textual Data
V. Choulakian, J. Allard
We present an overview of taxicab correspondence analysis, a robust variant of correspondence analysis, for visualization of extremely sparse ontingency tables. In particular we vi…
Uncovering and Displaying the Coherent Groups of Rank Data by Exploratory Riffle Shuffling
Vartan Choulakian, Jacques Allard
Let n respondents rank order d items, and suppose that d << n. Our main task is to uncover and display the structure of the observed rank data by an exploratory riffle shuffling pr…
TCA and TLRA: A comparison on contingency tables and compositional data
J. Allard, S. Champigny, V. Choulakian +1
There are two popular general approaches for the analysis and visualization of a contingency table and a compositional data set: Correspondence analysis (CA) and log ratio analysis…