Skip to main content

Recursive Adaptive ECOC models

  • Conference paper
  • First Online:
Progress in Artificial Intelligence (EPIA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2258))

Included in the following conference series:

Abstract

A general framework for the design of error adaptive learning algorithms in multiple output domains based on Dietterich’s ECOC approach, recursive error output correcting codes and iterative APP decoding methods is proposed. A particular class of these Recursive ECOC (RECOC) learning algorithms based on Low Density Parity Check is presented.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Dietterich, T., Bakiri, G.: Error-correcting output codes: A general method for improving multiclass inductive learning programs. Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91), pp. 572–577, Anaheim, CA: AAAI Press (1991)

    Google Scholar 

  2. Schapire, R. E., Singer, Y.: Improved Boosting Algorithms Using Confidence-rated Predictions. Machine Learning, Vol. 37, No. 3, pp. 277–296 (1999)

    Article  MATH  Google Scholar 

  3. Dietterich, T.: Ensemble Methods in Machine Learning. In J. Kittler and F. Roli (Eds.). Multiple Classifier Systems, MCS 01. Springer Lecture Notes in Computer Science, pp. 1–15, (2000)

    Chapter  Google Scholar 

  4. Tapia, E., González, J.C., Villena, J.: A Generalized Class of Boosting Algorithms Based on Recursive Decoding Models. In J. Kittler and F. Roli (Eds.). Multiple Classifier Systems, MCS 02. Springer Lecture Notes in Computer Science, pp. 22–31, Cambridge, UK, (2001)

    Google Scholar 

  5. Tapia, E, González, J.C., Villalba, L: On the design of Error Adaptive ECOC algorithms. In Proc. IDDM 2001 Workshop, 12th ECML, pp. 139–150, Freiburg (2001)

    Google Scholar 

  6. Gallager, R. G.: Low Density Parity-Check Codes. Cambridge, Massachusetts, M.I.T. Press (1963)

    Google Scholar 

  7. Massey, J.: Threshold Decoding. Cambridge, MA: M.I.T. Press (1963)

    Google Scholar 

  8. Kschischang F., Frey, B.: Iterative decoding of compound codes by probability propagation in graphical models. IEEE J. Sel. Areas in Comm. Vol. 16, No. 2, pp. 219–230 (1998)

    Article  Google Scholar 

  9. Tanner, M.: A recursive approach to Low Complexity Error Correcting Codes. IEEE Trans. Inf. Theory, Vol. 27, pp. 533–547 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  10. Berrou, C., Glavieux, A.: Near Optimum Error Correcting Coding and Decoding: Turbo Codes. IEEE Trans. on Communications, Vol. 44, No. 10, pp. 1261–1271 (1996)

    Article  Google Scholar 

  11. Benedetto S., Montorsi G.: Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes. IEEE Trans. Inf. Theory, Vol. 42, No. 2, pp. 409–428, (1996)

    Article  MATH  Google Scholar 

  12. Wiberg, N.: Codes and Decoding on General Graphs. Doctoral Dissertation, Department of Electrical Engineering, Linköping University, Sweden (1996)

    Google Scholar 

  13. Pearl, J.; "Fusion, Propagation and Structuring in Belief Networks", Artificial Intelligence, No. 29, pp. 241–268 (1986)

    Google Scholar 

  14. Richardson, T., Urbanke, R.: The Capacity of Low Density Parity Check Codes under Message Passing Decoding. IEEE Trans. Inf. Theory, Vol. 47, No. 2, pp. 599–618 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  15. MacKay, D. J.: Good Error Correcting Codes based on Very Sparse Matrices. IEEE Trans. Inf. Theory, Vol. 45, pp. 399–431 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  16. Witten, I., Frank E.: Data Mining, Practical Machine Learning Tools and Techniques with JAVA Implementations. Morgan Kaufmann Publishers, San Francisco, California (2000)

    Google Scholar 

  17. Fossorier, M. P.C., Mihaljevic, M., Hideki, I.: Reduced Complexity Iterative Decoding of Low Density Parity Check Codes Based on Belief Propagation. IEEE Trans. on Comm., Vol. 47, pp. 673–680 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tapia, E., González, J.C., García-Villalba, J., Villena, J. (2001). Recursive Adaptive ECOC models. In: Brazdil, P., Jorge, A. (eds) Progress in Artificial Intelligence. EPIA 2001. Lecture Notes in Computer Science(), vol 2258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45329-6_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45329-6_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43030-8

  • Online ISBN: 978-3-540-45329-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics