{'fraction_non_alphanumeric': 0.02109181141439206, 'fraction_numerical': 0.0, 'mean_word_length': 5.207692307692308, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Multiple correspondence analysis for "tall" data sets

Correspondence Analysis (CA) is a statistical method aiming at the graphical representation of the contingencies between the rows and the columns of a categorical data set. A critical step of the CA algorithm is the Singular Value Decomposition (SVD) analysis of a coded matrix. The size of this matrix affects drastically the analysis computational cost. As the size of the matrix increases, the method becomes computationally expensive or even impossible. In this paper we propose an alternative scheme that overpasses this limitation, without affecting the results accuracy. A set of Monte Carlo simulations and real data applications showed the efficiency of the proposed approach over the standard one, especially in the case of "tall" data sets.