Skip to main content

A Learning Algorithm for the Optimum-Path Forest Classifier

  • Conference paper
Graph-Based Representations in Pattern Recognition (GbRPR 2009)

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

Abstract

Graph-based approaches for pattern recognition techniques are commonly designed for unsupervised and semi-supervised ones. Recently, a novel collection of supervised pattern recognition techniques based on an optimum-path forest (OPF) computation in a feature space induced by graphs were presented: the OPF-based classifiers. They have some advantages with respect to the widely used supervised classifiers: they do not make assumption of shape/separability of the classes and run training phase faster. Actually, there exists two versions of OPF-based classifiers: OPF cpl (the first one) and OPF knn . Here, we introduce a learning algorithm for the last one and we show that a classifier can learns with its own errors without increasing its training set.

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

Access this chapter

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. Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley-Interscience, Hoboken (2000)

    MATH  Google Scholar 

  2. Kulis, B., Basu, S., Dhillon, I., Mooney, R.: Semi-supervised graph clustering: a kernel approach. In: ICML 2005: Proc. of the 22nd ICML, pp. 457–464. ACM, New York (2005)

    Google Scholar 

  3. Schlkopf, B., Zhou, D., Hofmann, T.: Semi-supervised learning on directed graphs. In: Adv. in Neural Information Processing Systems, pp. 1633–1640 (2005)

    Google Scholar 

  4. Callut, J., Fançoisse, K., Saerens, M.: Semi-supervised classification in graphs using bounded random walks. In: Proceedings of the 17th Annual Machine Learning Conference of Belgium and the Netherlands (Benelearn), pp. 67–68 (2008)

    Google Scholar 

  5. Kumar, N., Kummamuru, K.: Semisupervised clustering with metric learning using relative comparisons. IEEE Transactions on Knowledge and Data Engineering 20(4), 496–503 (2008)

    Article  Google Scholar 

  6. Hubert, L.J.: Some applications of graph theory to clustering. Psychometrika 39(3), 283–309 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  7. Zahn, C.T.: Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers C-20(1), 68–86 (1971)

    Article  MATH  Google Scholar 

  8. Jain, A.K., Dubes, R.C.: Algorithms for Clustering Data. Prentice-Hall, Inc., Upper Saddle River (1988)

    MATH  Google Scholar 

  9. Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)

    Article  Google Scholar 

  10. Haykin, S.: Neural networks: a comprehensive foundation. Prentice Hall, Englewood Cliffs (1994)

    MATH  Google Scholar 

  11. Boser, B.E., Guyon, I.M., Vapnik, V.N.: A training algorithm for optimal margin classifiers. In: Proceedings of the 5th Workshop on Computational Learning Theory, pp. 144–152. ACM Press, New York (1992)

    Google Scholar 

  12. Kuncheva, L.I.: Combining Pattern Classifiers: Methods and Algorithms. Wiley-Interscience, Hoboken (2004)

    Book  MATH  Google Scholar 

  13. Reyzin, L., Schapire, R.E.: How boosting the margin can also boost classifier complexity. In: Proceedings of the 23th International Conference on Machine learning, pp. 753–760. ACM Press, New York (2006)

    Google Scholar 

  14. Duan, K., Keerthi, S.S.: Which is the best multiclass svm method? an empirical study. In: Oza, N.C., Polikar, R., Kittler, J., Roli, F. (eds.) MCS 2005. LNCS, vol. 3541, pp. 278–285. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Papa, J.P., Falcão, A.X., Suzuki, C.T.N., Mascarenhas, N.D.A.: A discrete approach for supervised pattern recognition. In: Brimkov, V.E., Barneva, R.P., Hauptman, H.A. (eds.) IWCIA 2008. LNCS, vol. 4958, pp. 136–147. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Papa, J.P., Falcão, A.X.: A new variant of the optimum-path forest classifier. In: 4th International Symposium on Visual Computing, pp. I: 935–944 (2008)

    Google Scholar 

  17. Falcão, A.X., Stolfi, J., Lotufo, R.A.: The image foresting transform: Theory, algorithms, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(1), 19–29 (2004)

    Article  Google Scholar 

  18. Papa, J.P., Suzuki, C.T.N., Falcão, A.X.: LibOPF: A library for the design of optimum-path forest classifiers, Software version 1.0 (2008), http://www.ic.unicamp.br/~afalcao/LibOPF

  19. Chang, C.C., Lin, C.J.: LIBSVM: A Library for Support Vector Machines (2001), http://www.csie.ntu.edu.tw/~cjlin/libsvm

  20. Montoya-Zegarra, J.A., Papa, J.P., Leite, N.J., Torres, R.S., Falcão, A.X.: Learning how to extract rotation-invariant and scale-invariant features from texture images. EURASIP Journal on Advances in Signal Processing, 1–16 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papa, J.P., Falcão, A.X. (2009). A Learning Algorithm for the Optimum-Path Forest Classifier. In: Torsello, A., Escolano, F., Brun, L. (eds) Graph-Based Representations in Pattern Recognition. GbRPR 2009. Lecture Notes in Computer Science, vol 5534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02124-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02124-4_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02123-7

  • Online ISBN: 978-3-642-02124-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics