Computational Statistics

, Volume 29, Issue 1–2, pp 65–80 | Cite as

Spectral graph features for the classification of graphs and graph sequences

  • Miriam Schmidt
  • Günther Palm
  • Friedhelm Schwenker
Original Paper


In this paper, the classification power of the eigenvalues of six graph-associated matrices is investigated. Each matrix contains a certain type of geometric/ spatial information, which may be important for the classification process. The performances of the different feature types is evaluated on two data sets: first a benchmark data set for optical character recognition, where the extracted eigenvalues were utilized as feature vectors for multi-class classification using support vector machines. Classification results are presented for all six feature types, as well as for classifier combinations at decision level. For the decision level combination, probabilistic output support vector machines have been applied, with a performance up to 92.4 %. To investigate the power of the spectra for time dependent tasks, too, a second data set was investigated, consisting of human activities in video streams. To model the time dependency, hidden Markov models were utilized and the classification rate reached 98.3 %.


Graph classification Spectrum Graph-associated matrices  Optical character recognition Human activity recognition 



This paper is based on work done within the Information Fusion subproject of the Transregional Collaborative Research Center SFB/ TRR 62 Companion-Technology for Cognitive Technical Systems, funded by the German Research Foundation (DFG). The work of Miriam Schmidt is supported by a scholarship of the Graduate School Mathematical Analysis of Evolution, Information and Complexity of the University of Ulm. The authors want to thank Lutz Bigalke for recording, preprocessing and providing the data for the activity recognition task.


  1. Bigalke L (2011) Erkennung zusammengesetzter Nutzeraktivitäten mittels geschichteter Hidden-Markov-Modelle. diploma thesis, University of UlmGoogle Scholar
  2. Bishop CM (2007) Pattern recognition and machine learning (Information Science and Statistics). Springer, BerlinGoogle Scholar
  3. Bollobás B (2002) Modern graph theory, graduate texts in mathematics, 2nd edn. Springer, BerlinGoogle Scholar
  4. Brouwer AE, Haermers WH (2012) Spectra of graphs Universitext. SpringerGoogle Scholar
  5. Bunke H, Allermann G (1983) Inexact graph matching for structural pattern recognition. Pattern Recognit Lett 1(4):245–253CrossRefMATHGoogle Scholar
  6. Bunke H, Shearer K (1998) A graph distance metric based on the maximal common subgraph. Pattern Recognit Lett 19(3–4):255–259CrossRefMATHGoogle Scholar
  7. Chung FRK (1997) Spectral graph theory no 92 in CBMS regional conference series in mathematics. Oxford University Press, OxfordGoogle Scholar
  8. Cvetković DM, Doob M, Sachs H (1998) Spectra of graphs: theory and applications, 3rd edn. Vch Verlagsgesellschaft MbhGoogle Scholar
  9. Diestel R (2005) Graph theory, graduate texts in mathematics, vol 173, 3rd edn. Springer, BerlinGoogle Scholar
  10. Durbin R, Eddy S, Krogh A, Mitchison G (1998) Biological sequence analysis: probabilistic models of proteins and nucleic acids. Cambridge University Press, CambridgeCrossRefMATHGoogle Scholar
  11. Garey MR, Johnson DS (1990) Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman & Co, San FranciscoGoogle Scholar
  12. Glodek M, Bigalke L, Schels M, Schwenker F (2011) Incorporating uncertainty in a layered HMM architecture for human activity recognition. In: Proceedings of the joint workshop on human gesture and behavior understanding (J-HGBU’11), ACM, pp 33–34Google Scholar
  13. Juang BH, Rabiner LR (1991) Hidden markov models for speech recognition. Technometrics 33(3):251–272CrossRefMATHMathSciNetGoogle Scholar
  14. Luo B, Wilson RC, Hancock ER (2003) Spectral embedding of graphs. Pattern Recognit 36(10):2213–2230CrossRefMATHGoogle Scholar
  15. McLachlan G, Peel D (2000) Finite mixture models. Wiley series in probability and statistics: applied probability and statistics. Wiley, LondonCrossRefGoogle Scholar
  16. Murphy K (1998) Hidden markov model (HMM) toolbox for Matlab,
  17. Rabiner LR (1989) A tutorial on hidden markov models and selected applications in speech recognition. Proc IEEE 77:257–286CrossRefGoogle Scholar
  18. Riesen K, Bunke H (2008) IAM graph database repository for graph based pat-tern re -cog -ni -tion and machine learning. In: Proceedings of the joint IAPR international workshop on structural, syntactic, and statistical pattern recognition (SSPR &SPR’08). Springer, LNCS 5342:287–297Google Scholar
  19. Riesen K, Neuhaus M, Bunke H (2007a) Bipartite graph matching for computing the edit distance of graphs. In: Escolano F, Vento M (eds) Proceedings of the 6th IAPR-TC-15 international conference on graph-based representations in pattern recognition . Springer, LNCS 4538:1–12Google Scholar
  20. Riesen K, Neuhaus M, Bunke H (2007b) Graph embedding in vector spaces by means of prototype selection. In: Escolano F, Vento M (eds) Proceedings of the 6th IAPR-TC-15 international workshop on graph-based representations in pattern recognition (GbRPR’07) . Springer, LNCS 4538:383–393Google Scholar
  21. Sanfeliu A, Fu KS (1983) A distance measure between attributed relational graphs for pattern recognition. IEEE Trans Syst Man Cybern 13(3):353–362CrossRefMATHGoogle Scholar
  22. Schmidt M, Schwenker F (2011) Classification of graph sequences utilizing the eigenvalues of the distance matrices and hidden markov models. In: Jiang X, Ferrer M, Torsello A (eds) Proceedings of the 8th IAPR-TC-15 international workshop on graph-based representations in pattern recognition (GBRPR’11) . Springer, LNCS 6658:325–334Google Scholar
  23. Schmidt M, Schels M, Schwenker F (2010) A hidden markov model based approach for facial expression recognition in image sequences. In: Schwenker F, El Gayar N (eds) Proceedings of the 4th IAPR TC3 workshop on artificial neural networks in pattern recognition (ANNPR’10). Springer, Cairo, Egypt, LNAI 5998:149–160Google Scholar
  24. Scholkopf B, Smola AJ (2002) Learning with kernels: support vector machines, regularization, optimization, and beyond adaptive computation and machine learning. MIT Press, CambridgeGoogle Scholar
  25. Umeyama S (1988) An eigendecomposition approach to weighted graph matching problems. IEEE Trans Pattern Anal Mach Intell 10(5):695–703CrossRefMATHGoogle Scholar
  26. Vapnik VN (1999) The nature of statistical learning theory. Statistics for engineering and information science, 2nd edn. Springer, BerlinGoogle Scholar
  27. Watson JD, Laskowski RA, Thornton JM (2005) Predicting protein function from sequence and structural data. Curr Opin Struct Biol 15(3):275–284CrossRefGoogle Scholar
  28. Wilson A, Bobick A (1999) Parametric hidden markov models for gesture recognition. IEEE Trans Pattern Anal Mach Intell 21(9):884–900CrossRefGoogle Scholar
  29. Wilson RC, Hancock ER, Luo B (2005) Pattern vectors from algebraic graph theory. IEEE Trans Pattern Anal Mach Intell 27(7):1112–1124CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Miriam Schmidt
    • 1
  • Günther Palm
    • 1
  • Friedhelm Schwenker
    • 1
  1. 1.Institute of Neural Information ProcessingUniversity of Ulm UlmGermany

Personalised recommendations