Skip to main content
SpringerLink
Log in

Towards Bridging the Gap between Statistical and Structural Pattern Recognition: Two New Concepts in Graph Matching

  • Conference paper
  • First Online:
Advances in Pattern Recognition — ICAPR 2001 (ICAPR 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2013))

Included in the following conference series:

Abstract

Two novel concepts in structural pattern recognition are discussed in this paper. The first, median of a set of graphs, can be used to characterize a set of graphs by just a single prototype. Such a characterization is needed in various tasks, for example, in clustering. The second novel concept is weighted mean of a pair of graphs. It can be used to synthesize a graph that has a specified degree of similarity, or distance, to each of a pair of given graphs. Such an operation is needed in many machine learning tasks. It is argued that with these new concepts various well-established techniques from statistical pattern recognition become applicable in the structural domain, particularly to graph representations. Concrete examples include k-means clustering, vector quantization, and Kohonen maps.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Admin, D. Dori, P. Pudil, and H. Freemann, editors. Advances in Pattern Recognition. Number 1451 in LNCS. Springer, 1998.

    Google Scholar 

  2. H. Bunke, editor. Advances in Structural and Syntactical Pattern Recognition. World Scientific Publ. Co., 1992.

    Google Scholar 

  3. H. Bunke. Error-tolerant graph matching: a formal framework and algorithms. In [1], pages 1–14. 1998.

    Google Scholar 

  4. H. Bunke and A. Kandel. Mean and maximum common subgraph of two graphs. Pattern Recognition Letters, 21:163–168, 2000.

    Article  Google Scholar 

  5. H. Bunke, A. Münger, and X. Jiang. Combinatorial search versus genetic algorithms: a case study based on the generalized mean graph problem. Pattern Recognition Letters, 20:1271–1277, 1999.

    Article  Google Scholar 

  6. H. Bunke and A. Sanfeliu, editors. Syntactic and Structural Pattern Recognition-Theory and Applications. World Scientific Publ. Co., 1990.

    Google Scholar 

  7. F. Casacuberta and M. Antonia. A greedy algorithm for computing approximate median strings. In Proc. Nat. Symp. of Pattern Recognition and Image Analysis, pages 193–198, Barcelona, Spain, 1996.

    Google Scholar 

  8. D. Dori and A. Bruckstein, editors. Shape, Structure and Pattern Recognition. World Scientific Publ. Co., 1995.

    Google Scholar 

  9. R. Englert and R. Glanz. Towards the clustering of graphs. In Proc. 2nd IAPR-TC-15 Workshop on Graph Based Representations, pages 125–133, 2000.

    Google Scholar 

  10. K. Fu. Syntactic Pattern Recognition and Applications. Prentice Hall, 1982.

    Google Scholar 

  11. S. Günter. Kohonen map for the domain of graphs. Master’s thesis, University of Bern. In progress (in German).

    Google Scholar 

  12. A. Jain, R. Duin, and J. Mao. Statistical Pattern Recognition: A Review. IEEE Trans PAMI, 22:4–37, 2000.

    Google Scholar 

  13. X. Jiang, A. Münger, and H. Bunke. Synthesis of representative symbols by computing generalized median graphs. In Proc. Int. Workshop on Graphics Recognition GREC’ 99, pages 187–194, Jaipur, 1999.

    Google Scholar 

  14. X. Jiang, A. Münger, and H. Bunke. Computing the generalized median of a set of graphs. In Proc. 2nd IAPR-TC-15 Workshop on Graph Based Representations, pages 115–124, 2000.

    Google Scholar 

  15. X. Jiang, A. Münger, and H. Bunke. On median graphs: Properties, algorithms, and applications. Submitted, 2000.

    Google Scholar 

  16. X. Jiang, L. Schiffmann, and H. Bunke. Computation of median shapes. In 4th Asian Conf. on Computer Vision, pages 300–305, Taipei, Taiwan, 2000.

    Google Scholar 

  17. T. Kohonen. Self-Organizing Maps. Springer Verlag, 1995.

    Google Scholar 

  18. F. Kruzslicz. Improved greedy algorithm for computing approximate median strings. Acta Cybernetica, 14:331–339, 1999.

    MATH  MathSciNet  Google Scholar 

  19. D. Lopresti and J. Zhou. Using consensus voting to correct OCR errors. Computer Vision and Image Understanding, 67(1):39–47, 1997.

    Article  Google Scholar 

  20. S.-Y. Lu. A tree-to-tree distance and its application to cluster analysis. IEEE Trans. PAMI, 1:219–224, 1979.

    MATH  Google Scholar 

  21. P. Perner, P. Wang, and A. Rosenfeld, editors. Advances in Structural and Syntactical Pattern Recognition. Number 1121 in LNCS. Springer, 1996.

    Google Scholar 

  22. S. Rice, J. Kanai, and T. Nartker. A difference algorithm for OCR-generated text. In [2], pages 333–341, 1992.

    Google Scholar 

  23. D. Seong, H. Kim, and K. Park. Incremental clustering of attributed graphs. IEEE Trans. SMC, 23:1399–1411, 1993.

    Google Scholar 

  24. R. Wagner and M. Fischer. The string-to-string correction problem. Journal of the Association for Computing Machinery, 21(1):168–173, 1974.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Univ. of Bern, Switzerland

    H. Bunke, S. Günter & X. Jiang

Authors
  1. H. Bunke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Günter
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. X. Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Exeter, EX4 4PT, Exeter, UK

    Sameer Singh

  2. Computational Intelligence Group, Tuiuti University of Parana, Curitiba, Brazil

    Nabeel Murshed

  3. Institute of Computer Aided Automation PRIP-Group 1832, Vienna University of Technology, Favoritenstr. 9/2/4, 1040, Wien, Austria

    Walter Kropatsch

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bunke, H., Günter, S., Jiang, X. (2001). Towards Bridging the Gap between Statistical and Structural Pattern Recognition: Two New Concepts in Graph Matching. In: Singh, S., Murshed, N., Kropatsch, W. (eds) Advances in Pattern Recognition — ICAPR 2001. ICAPR 2001. Lecture Notes in Computer Science, vol 2013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44732-6_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-44732-6_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41767-5

  • Online ISBN: 978-3-540-44732-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation