Journal of Classification

, Volume 32, Issue 1, pp 3–20 | Cite as

Shuffled Graph Classification: Theory and Connectome Applications

  • Joshua T. VogelsteinEmail author
  • Carey E. Priebe


We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are called shuffled graphs. Our formalism provides insight to trivially answer a number of open statistical questions including: (i) under what conditions does shuffling the vertices degrade classification performance and (ii) do universally consistent graph classifiers exist? The answers to these questions lead to practical heuristic algorithms with state-of-the-art finite sample performance, in agreement with our theoretical asymptotics. Applying these methods to classify sex and autism in two different human connectome classification tasks yields successful classification results in both applications.


Statistical pattern recognition Random graphs Graph matching Connectomics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. DESIKAN, R.S., SÉGONNE, F., FISCHL, B., QUINN, B.T., DICKERSON, B.C., BLACKER, D., . . . KILLIANY, R.J. (2006), “An Automated Labeling System for Subdividing the Human Cerebral Cortex on MRI Scans into Gyral Based Regions of Interest”, NeuroImage 31(3), 968–980.Google Scholar
  2. DEVROYE, L., GY ÖRFI, L., and LUGOSI, G. (1996), A Probabilistic Theory of Pattern Recognition, New York: Springer,Google Scholar
  3. DI MARTINO, A., YAN, C.G., LI, Q., DENIO, E., CASTELLANOS, F.X., ALAERTS, K., . . . MILHAM, M.P.(2013),“The Autism Brain Imaging Data Exchange: Towards a Large-Scale Evaluation of the Intrinsic Brain Architecture in Autism”, Molecular Psychiatry, advance online publication June 2013, doi 10.1038/mp.2013.78.
  4. DUIN, R.P.W., and P ÄKALSKA, E. (2011), “The Dissimilarity Space: Bridging Structural and Statistical Pattern Recognition”, Pattern Recognition Letters, 33, 826–832.Google Scholar
  5. FORTIN, S. (1996), “The Graph Isomorphism Problem”, Technical Report, University of Alberta, Department of Computer Science.Google Scholar
  6. GAREY, M.R., and JOHNSON, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, New York: W.H. Freeman.Google Scholar
  7. GIBERT, J., VALVENY, E., and BUNKE, H. (2012), “Graph Embedding in Vector Spaces by Node Attribute Statistics”, Pattern Recognition 45(9), 3072–3083Google Scholar
  8. GRAY, W.R., BOGOVIC, J.A., VOGELSTEIN,J.T., LANDMAN, B.A., PRINCE, J.L., and VOGELSTEIN, R.J. (2010), “Magnetic Resonance Connectome Automated Pipeline: An Overview”, IEEE Pulse 3(2), 42–48.Google Scholar
  9. HAGMANN, P. (2005), “From Diffusion MRI to Brain Connectomics”, PhD thesis, Institut de traitement des signaux, University of Lausanne, Switzerland.Google Scholar
  10. HAGMANN, P., CAMMOUN, L., GIGANDET, X., GERHARD, S., ELLEN GRANT, P., WEDEEN, V.,. . . SPORNS, O. (2010), “MR Connectomics: Principles and Challenges”, Journal Neuroscience Methods, 194(1), 34–45.Google Scholar
  11. KASHIMA, H., and INOKUCHI, A. (2002), “Kernels for Graph Classification”, in Proceedings of the ICDM Workshop on Active Mining, Maebashi, Japan, 2002.Google Scholar
  12. KETKAR, N.S., HOLDER, L.B., and COOK, D.J. (2009), “Empirical Comparison of Graph Classification Algorithms”, IEEE Symposium on Computational Intelligence and Data Mining, pp. 259–266.Google Scholar
  13. OEIS (2013), “The On-Line Encyclopedia of Integer Sequences: Number of Graphs on n Unlabeled Nodes”,
  14. PAO, H., COPPERSMITH, G.A., and PRIEBE, C.E (2011), “Statistical Inference on Random Graphs: Comparative Power Analyses Via Monte Carlo”, Journal of Computational and Graphical Statistics, 20, 295–416.Google Scholar
  15. PRIEBE, C.E., COPPERSMITH, G.A., and RUKHIN, A. (2010), “You Say Graph Invariant, I Say Test Statistic”, Statistical Computing Statistical Graphics Newsletter, 21(2), 11–14.Google Scholar
  16. SAIGO, H., NOWOZIN, S., KADOWAK,I T., KUDO, T., and TSUDA, K. (2008), “gBoost: A Mathematical Programming Approach to Graph Classification and Regression”, Machine Learning 75(1), 69–89.Google Scholar
  17. SPORNS, O. (2010), Networks of the Brain, Cambridge MA: The MIT Press.Google Scholar
  18. STONE, C.J. (1977), “Consistent Nonparametric Regression”, The Annals of Statistics 5(4), 595–620.Google Scholar
  19. VOGELSTEIN, J.T., CONROY, J.C., PODRAZIK, L.J., KRATZER, S.G., FISHKIND, D.E., VOGELSTEIN, R.J., and PRIEBE, C.E. (2011), “Fast Inexact Graph Mathing with Applications in Statistical Connectomics”,
  20. VOGELSTEIN, J.T., GRAY, W.R., VOGELSTEIN, R.J., and PRIEBE, C.E. (2013), “Graph Classification Using Signal Subgraphs: Applications in Statistical Connectomics”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(7), 1539–1551.Google Scholar
  21. VOGELSTEIN, J.T., VOGELSTEIN, R.J., and PRIEBE, C..E (2009), “Are Mental Properties Supervenient on Brain Properties?” Nature Scientific Reports 1(100), 11.Google Scholar
  22. WHITE, J.G., SOUTHGATE, E., THOMSON, J.N., and BRENNER, S. (1986), “The Structure of the Nervous System of the Nematode Caenorhabditis Elegans”, Philosophical Transactions of Royal Society London Series B, Biological Sciences 314(1165), 1–340.Google Scholar
  23. ZARE BORZESHI, E., PICCARDI, M., RIESEN, K., and BUNKE, H. (2012), “Discriminative Prototype Selection Methods for Graph Embedding”, Pattern Recognition 46(6), 1648–1657.Google Scholar

Copyright information

© Classification Society of North America 2015

Authors and Affiliations

  1. 1.Johns Hopkins UniversityBaltimoreUSA
  2. 2.Duke UniversityDurhamUSA
  3. 3.Child Mind InstituteNew YorkUSA
  4. 4.DurhamUSA

Personalised recommendations