IDEAS home Printed from https://ideas.repec.org/p/ems/eureir/550.html
   My bibliography  Save this paper

Inverse correspondence analysis

Author

Listed:
  • Groenen, P.J.F.
  • van de Velden, M.

Abstract

In correspondence analysis, rows and columns of a data matrix are depicted as points in low-dimensional space. The row and column profiles are approximated by minimizing the so-called weighted chi squared distance between the original profiles and their approximations, see or example, Greenacre (1984). In this paper, we will study the inverse correspondence analysis solution. We will show that there exists a nonempty closed and bounded polyhedron of such matrices. We also present an algorithm to find the vertices of the polyhedron. A proof that the maximum of the Pearson chi-squared statistic is attained at one of the vertices is given. In addition, it is discussed how extra equality constraints on some elements of the data matrix can be imposed on the inverse correspondence analysis problem. As a special case, we present a method for imposing integer restrictions on the data matrix as well. The approach to inverse correspondence analysis followed here is similar to the one employed by De Leeuw and Groenen (1997) in their inverse multidimensional scaling problem.

Suggested Citation

  • Groenen, P.J.F. & van de Velden, M., 2002. "Inverse correspondence analysis," Econometric Institute Research Papers EI 2002-31, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    • Handle: RePEc:ems:eureir:550
    as

    Download full text from publisher

    File URL: https://repub.eur.nl/pub/550/feweco20020920120412.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Carl Eckart & Gale Young, 1936. "The approximation of one matrix by another of lower rank," Psychometrika, Springer;The Psychometric Society, vol. 1(3), pages 211-218, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sewell, Daniel K., 2018. "Visualizing data through curvilinear representations of matrices," Computational Statistics & Data Analysis, Elsevier, vol. 128(C), pages 255-270.
    2. Jushan Bai & Serena Ng, 2020. "Simpler Proofs for Approximate Factor Models of Large Dimensions," Papers 2008.00254, arXiv.org.
    3. Adele Ravagnani & Fabrizio Lillo & Paola Deriu & Piero Mazzarisi & Francesca Medda & Antonio Russo, 2024. "Dimensionality reduction techniques to support insider trading detection," Papers 2403.00707, arXiv.org, revised May 2024.
    4. Alfredo García-Hiernaux & José Casals & Miguel Jerez, 2012. "Estimating the system order by subspace methods," Computational Statistics, Springer, vol. 27(3), pages 411-425, September.
    5. Mitzi Cubilla‐Montilla & Ana‐Belén Nieto‐Librero & Ma Purificación Galindo‐Villardón & Ma Purificación Vicente Galindo & Isabel‐María Garcia‐Sanchez, 2019. "Are cultural values sufficient to improve stakeholder engagement human and labour rights issues?," Corporate Social Responsibility and Environmental Management, John Wiley & Sons, vol. 26(4), pages 938-955, July.
    6. Jos Berge & Henk Kiers, 1993. "An alternating least squares method for the weighted approximation of a symmetric matrix," Psychometrika, Springer;The Psychometric Society, vol. 58(1), pages 115-118, March.
    7. Shimeng Huang & Henry Wolkowicz, 2018. "Low-rank matrix completion using nuclear norm minimization and facial reduction," Journal of Global Optimization, Springer, vol. 72(1), pages 5-26, September.
    8. Antti J. Tanskanen & Jani Lukkarinen & Kari Vatanen, 2016. "Random selection of factors preserves the correlation structure in a linear factor model to a high degree," Papers 1604.05896, arXiv.org, revised Dec 2018.
    9. Jin-Xing Liu & Yong Xu & Chun-Hou Zheng & Yi Wang & Jing-Yu Yang, 2012. "Characteristic Gene Selection via Weighting Principal Components by Singular Values," PLOS ONE, Public Library of Science, vol. 7(7), pages 1-10, July.
    10. Kargin, V. & Onatski, A., 2008. "Curve forecasting by functional autoregression," Journal of Multivariate Analysis, Elsevier, vol. 99(10), pages 2508-2526, November.
    11. Yoshio Takane & Forrest Young & Jan Leeuw, 1977. "Nonmetric individual differences multidimensional scaling: An alternating least squares method with optimal scaling features," Psychometrika, Springer;The Psychometric Society, vol. 42(1), pages 7-67, March.
    12. W. Gibson, 1962. "On the least-squares orthogonalization of an oblique transformation," Psychometrika, Springer;The Psychometric Society, vol. 27(2), pages 193-195, June.
    13. Walter Kristof, 1967. "Orthogonal inter-battery factor analysis," Psychometrika, Springer;The Psychometric Society, vol. 32(2), pages 199-227, June.
    14. Willem E. Saris & Marius de Pijper & Jan Mulder, 1978. "Optimal Procedures for Estimation of Factor Scores," Sociological Methods & Research, , vol. 7(1), pages 85-106, August.
    15. Merola, Giovanni Maria & Chen, Gemai, 2019. "Projection sparse principal component analysis: An efficient least squares method," Journal of Multivariate Analysis, Elsevier, vol. 173(C), pages 366-382.
    16. Juan Carlos Carrasco Baquero & Verónica Lucía Caballero Serrano & Fernando Romero Cañizares & Daisy Carolina Carrasco López & David Alejandro León Gualán & Rufino Vieira Lanero & Fernando Cobo-Gradín, 2023. "Water Quality Determination Using Soil and Vegetation Communities in the Wetlands of the Andes of Ecuador," Land, MDPI, vol. 12(8), pages 1-18, August.
    17. Naoto Yamashita & Shin-ichi Mayekawa, 2015. "A new biplot procedure with joint classification of objects and variables by fuzzy c-means clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 9(3), pages 243-266, September.
    18. Johannes Burge & Priyank Jaini, 2017. "Accuracy Maximization Analysis for Sensory-Perceptual Tasks: Computational Improvements, Filter Robustness, and Coding Advantages for Scaled Additive Noise," PLOS Computational Biology, Public Library of Science, vol. 13(2), pages 1-32, February.
    19. Elvin Isufi & Andreas Loukas & Nathanael Perraudin & Geert Leus, 2018. "Forecasting Time Series with VARMA Recursions on Graphs," Papers 1810.08581, arXiv.org, revised Jul 2019.
    20. Naccarato, Alessia & Zurlo, Davide & Pieraccini, Luciano, 2012. "Least Orthogonal Distance Estimator and Total Least Square," MPRA Paper 42365, University Library of Munich, Germany.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ems:eureir:550. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: RePub (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.