Skip to main content
Log in

Graph Partitioning by Correspondence Analysis and Taxicab Correspondence Analysis

Journal of Classification Aims and scope Submit manuscript

Abstract

We consider correspondence analysis (CA) and taxicab correspondence analysis (TCA) of relational datasets that can mathematically be described as weighted loopless graphs. Such data appear in particular in network analysis. We present CA and TCA as relaxation methods for the graph partitioning problem. Examples of real datasets are provided.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • ALON, N., and NAOR, A. (2006), “Approximating the Cut-Norm via Grothendieck’s In-equality,” SIAM Journal on Computing, 35, 787–803.

    Article  MathSciNet  MATH  Google Scholar 

  • BENZECRI, J.P. (1973), L’Analyse des Données: Vol. 2: L’Analyse des Correspondances, Paris: Dunod.

    Google Scholar 

  • BENZECRI, J.P. (1992), Correspondence Analysis Handbook, N.Y: Marcel Dekker.

    MATH  Google Scholar 

  • BURT, C. (1917), The Distribution and Relations of Educational Abilities, London: P.S. King and Son.

    Google Scholar 

  • CHOULAKIAN, V. (2003), “The Optimality of the Centroid Method”, Psychometrika, 68, 473–475.

    Article  MathSciNet  Google Scholar 

  • CHOULAKIAN, V. (2005), “Transposition Invariant Principal Component Analysis in L1 for Long Tailed Data”, Statistics and Probability Letters, 71, 23–31.

    Article  MathSciNet  MATH  Google Scholar 

  • CHOULAKIAN, V. (2006a), “Taxicab Correspondence Analysis”, Psychometrika, 71, 333–345.

    Article  MathSciNet  Google Scholar 

  • CHOULAKIAN, V. (2006b), “L1 Norm Projection Pursuit Principal Component Analysis”, Computational Statistics and Data Analysis, 50, 1441–1451.

    Article  MathSciNet  MATH  Google Scholar 

  • CHOULAKIAN, V. (2008a), “Taxicab Correspondence Analysis of Contingency Tables with One Heavyweight Column”, Psychometrika, 73, 309–319.

    Article  MathSciNet  MATH  Google Scholar 

  • CHOULAKIAN, V. (2008b), “Multiple Taxicab Correspondence Analysis”, Advances in Data Analysis and Classification, 2, 177–206.

    Article  MathSciNet  Google Scholar 

  • CHOULAKIAN, V., KASPARIAN, S., MIYAKE, M., AKAMA, H., MAKOSHI, N., and NAKAGAWA, M. (2006), “A Statistical Analysis of Synoptic Gospels” JADT’2006, 281–288.

    Google Scholar 

  • CHOULAKIAN, V., ALLARD, J., and SIMONETTI, B. (2012), ”Multiple Taxicab Correspondence Analysis of a Survey Related to Health Services”, Journal of Data Science, to appear.

  • DE TIBEIRO, J. (1996), “Sur les Traits associés par Paires : Malformations cardiaques congénitales chez des Enfants ayant mêmes Parents”, Les Cahiers de l’Analyse des Données, 21, 45–52.

    Google Scholar 

  • DE TIBEIRO, J., and MURDOCH, D.J. (2010), “Correspondence Analysis with Incomplete Paired Data Using Bayesian Imputation”, Bayesian Analysis, 5(3), 1–14.

    Article  MathSciNet  Google Scholar 

  • DING, C. (2004), “A Tutorial on Spectral Clustering”, talk presented at ICML, http://ranger.uta.edu/˜chqding/Spectral/spectralA.pdf.

  • DING, C., HE, X., ZHA, H., GU, M., and SIMON, H. (2001), “A Min-Max Cut Algorithm for Graph Partitioning and Data Clustering”, Proceedings of the first IEEE International Conference on Data Mining (ICDM), IEEE Computer Society, Washington, 107–114.

  • DINWOODIE, I., and MACGIBBON, B. (2003), “Exact Analysis of a Paired Sibling Study”, Technical Report 2003-10, SAMSI.

  • FICHET, B. (2009), “Metrics of L p -type and Distributional Equivalence Principle”, Advances in Data Analysis and Classification, 3, 305–314.

    Article  MathSciNet  Google Scholar 

  • FIEDLER, M. (1973), “Algebraic Connectivity of Graphs”, Czechoslovak Mathematical Journal, 23(98), 298–305.

    MathSciNet  Google Scholar 

  • FRASER, F.C., and Hunter, A.D.W. (1975), “Etiologic Relations Among Categories of Congenital Heart Malformations”, The American Journal of Cardiology, 36, 793–796.

    Article  Google Scholar 

  • GABRIEL, K.R., and ZAMIR, S. (1979), “Lower Rank Approximation of Matrices by Least Squares with Any Choice of Weights”, Technometrics, 21, 489–498.

    Article  MATH  Google Scholar 

  • GIFI, A. (1990), Nonlinear Multivariate Analysis, New York: Wiley.

    MATH  Google Scholar 

  • GREENACRE, M.J. (1984), Theory and Applications of Correspondence Analysis, New York: Academic Press.

    MATH  Google Scholar 

  • HAGEN, L., and KAHNG, A.(1992), “New Spectral Methods for Ratio Cut Partitioning and Clustering”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 11(9), 1074–1085.

    Article  Google Scholar 

  • HARMAN, H.H. (1967), Modern Factor Analysis, Chicago: The University of Chicago Press.

    MATH  Google Scholar 

  • HORST, P. (1965), Factor Analysis of Data Matrices, New York: Holt Rinehart and Winston.

    MATH  Google Scholar 

  • JOLLIFFE, I.T. (2002), Principal Component Analysis (2nd ed.), New York: Springer.

    MATH  Google Scholar 

  • KOLACZYK, E.D. (2009), Statistical Analysis of Network Data, New York: Springer.

    Book  MATH  Google Scholar 

  • KREYSZIG, E. (1978), Introduction to Functional Analysis with Applications, New York: Wiley.

    Google Scholar 

  • LEBART, L. (1969), “Analyse statistique de la Contiguité”, Publication de l’ISUP, XVIII, 81–112.

  • LEBART, L. (2000), “Contiguity Analysis and Classification”, in Data Analysis, eds. W. Gaul, O. Opitz, and M. Schader, Berlin: Springer, pp. 233–244.

    Chapter  Google Scholar 

  • MACGIBBON, B. (1983), “A Log-Linear Model of a Paired Sibling Study”, in Proceedings of Statistics ’81 Canada Conference, eds. Y. Chaubey and T.D. Dwivedi, Montreal, pp. 193–197.

  • MOHAR, B. (1997), “Some Applications of Laplace Eigenvalues of Graphs”, in Graph Symmetry: Algebraic Methods and Applications, eds. G. Hahn and G. Sabidussi, NATO ASI Series C 497, Dordrecht: Kluwer, pp. 225–275.

  • NISHISATO, S. (1994), Elements of Dual Scaling: An Introduction to Practical Data Analysis, Hillsdale NJ: Lawrence Erlbaum.

    Google Scholar 

  • SEARY, A.J., and RICHARDS, W.D (1995), “Partitioning Networks by Eigenvectors”, Proceedings of International Conference on Social Networks, Vol. 1, London, pp. 47–58.

  • SHI, J., and MALIK, J.(2000), “Normalized Cuts and Image Segmentation” IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 888–905.

    Article  Google Scholar 

  • THURSTONE, L.L. (1931), “Multiple Factor Analysis”, Psychological Review, 38, 406–427.

    Article  Google Scholar 

  • THURSTONE, L.L. (1947), Multiple Factor Analysis, Chicago: The University of Chicago Press.

    MATH  Google Scholar 

  • VON LUXBURG, U. (2007), “A Tutorial on Spectral Clustering”, Statistics and Computing, 17, 395–416.

    Article  MathSciNet  Google Scholar 

  • WOLD, H. (1966), “Estimation of Principal Components and Related Models by Iterative Least Squares”, in Multivariate Analysis, ed. P.R. Krishnaiah, New York: Academic Press, pp. 391–420.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vartan Choulakian.

Additional information

Vartan Choulakian is supported by a grant from the Natural Science and Research Council of Canada.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Choulakian, V., de Tibeiro, J. Graph Partitioning by Correspondence Analysis and Taxicab Correspondence Analysis. J Classif 30, 397–427 (2013). https://doi.org/10.1007/s00357-013-9145-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00357-013-9145-4

Key words

Navigation