Skip to main content
Springer Nature Link
Log in

Algorithms for the Sample Mean of Graphs

  • Conference paper
Computer Analysis of Images and Patterns (CAIP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 5702))

Included in the following conference series:

Abstract

Measures of central tendency for graphs are important for protoype construction, frequent substructure mining, and multiple alignment of protein structures. This contribution proposes subgradient-based methods for determining a sample mean of graphs. We assess the performance of the proposed algorithms in a comparative empirical study.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ferrer, M.: Theory and algorithms on the median graph. Application to graph-based classification and clustering, PhD Thesis, Univ. Autònoma de Barcelona (2007)

    Google Scholar 

  2. Gold, S., Rangarajan, A.: Graduated Assignment Algorithm for Graph Matching. IEEE Trans. Pattern Analysis and Machine Intelligence 18, 377–388 (1996)

    Article  Google Scholar 

  3. Günter, S., Bunke, H.: Self-organizing map for clustering in the graph domain. Pattern Recognition Letters 23, 401–417 (2002)

    Article  Google Scholar 

  4. Jain, B., Stehr, H., Lappe, M.: Multiple Alignment of Contact Maps. In: IJCNN 2009 Conference Proceedings (2009)

    Google Scholar 

  5. Jain, B., Obermayer, K.: On the sample mean of graphs. In: IJCNN 2008 Conference Proceedings, pp. 993–1000 (2008)

    Google Scholar 

  6. Jiang, X., Munger, X.A., Bunke, H.: On Median Graphs: Properties, Algorithms, and Applications. IEEE Trans. PAMI 23(10), 1144–1151 (2001)

    Google Scholar 

  7. Luo, B., et al.: Clustering shock trees. In: GbR 2001, pp. 217–228 (2001)

    Google Scholar 

  8. Mäkelä, M., Neittaanmäki, P.: Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control. World Scientific, Singapore (1992)

    MATH  Google Scholar 

  9. Mukherjee, L., et al.: Generalized median graphs and applications. Journal of Combinatorial Optimization 17, 21–44 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  10. Saitou, N., Nei, M.: The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4(4), 406–425 (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Berlin Institute of Technology, Germany

    Brijnesh J. Jain & Klaus Obermayer

Authors
  1. Brijnesh J. Jain
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Klaus Obermayer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Münster, Einsteinstrasse 62, 48149, Münster, Germany

    Xiaoyi Jiang

  2. Institute of Mathematics and Computing Science, University of Groningen, Nijenborgh 9, 9747, Groningen, AG, The Netherlands

    Nicolai Petkov

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jain, B.J., Obermayer, K. (2009). Algorithms for the Sample Mean of Graphs. In: Jiang, X., Petkov, N. (eds) Computer Analysis of Images and Patterns. CAIP 2009. Lecture Notes in Computer Science, vol 5702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03767-2_43

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03767-2_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03766-5

  • Online ISBN: 978-3-642-03767-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics