Skip to main content
SpringerLink
Log in

Structured Weight-Based Prediction Algorithms

  • Conference paper
  • First Online:
Algorithmic Learning Theory (ALT 1998)

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

Included in the following conference series:

  • 374 Accesses

Abstract

Reviewing structured weight-based prediction algorithms (SWP for short) due to Takimoto, Maruoka and Vovk, we present underlying design methods for constructing a variety of on-line prediction algorithms based on the SWP. In particular, we shown how the typical expert model where the experts are considered to be arranged on one layer can be generalized to the case where they are laid on a tree structure so that the expert model can be applied to search for the best pruning in a straightforward fashion through dynamic programming scheme.

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. N. Cesa-Bianchi, Y. Freund, D. Helmbold, D. Haussler, R. Schapire and M. Warmuth, How to use expert advice, JACM 44(3) (1997) 427–485.

    Article  MATH  MathSciNet  Google Scholar 

  2. Y. Freund and R. E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, in: P. Vitányi, ed., Computational Learning Theory, Lecture Notes in Computer Science, Vol. 904 (Springer, Berlin, 1995) 23–37. To appear in J. Computer System Sciences.

    Google Scholar 

  3. D. Helmbold and R. Schapire, Predicting nearly as well as the best pruning of a decision tree, Machine Learning, 27 (1997) 51–68.

    Article  Google Scholar 

  4. M. Kearns and Y. Mansour, A fast, bottom-up decision tree pruning algorithm with near-optimal generalization, To appear in the Machine Learning Conference.

    Google Scholar 

  5. N. Littlestone and M. K. Warmuth, The weighted majority algorithm, Inform. Computation 108 (1994) 212–261.

    Article  MATH  MathSciNet  Google Scholar 

  6. E. Takimoto, K. Hirai and A. Maruoka, A simple algorithm for predicting nearly as well as the best pruning labeled with the best prediction values of a decision tree, in: M. Li and A. Maruoka, eds., Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, Vol. 1316 (1997) 385–400.

    Google Scholar 

  7. E. Takimoto, A. Maruoka and V. Vovk, Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme, submitted.

    Google Scholar 

  8. V. Vovk, Aggregating strategies, in: Proc. 3rd COLT (Morgan Kaufmann, San Mateo, CA, 1990) 371–383.

    Google Scholar 

  9. V. Vovk, A game of prediction with expert advice, accepted for publication in J. Comput. Inform. Syst. Short version in: Proc. 8th COLT (Assoc. Comput. Mach., New York, 1995) 51–60.

    Google Scholar 

  10. L. G. Valiant, A theory of the learnable, Comm. ACM27 (1084) 1134–1142.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Sciences, Tohoku University, Sendai, 980-8579, Japan

    Akira Maruoka & Eiji Takimoto

Authors
  1. Akira Maruoka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eiji Takimoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AG Künstliche Intelligenz - Expertensysteme, UniversitÄt Kaiserslautern, Postfach 3049, D-67653, Kaiserslautern, Germany

    Michael M. Richter

  2. Department of Computer Science, University of Maryland, College Park, MD, 20742, USA

    Carl H. Smith

  3. AG Algorithmischesn Lernen, UniversitÄt Kaiserslautern, Postfach 3049, D-67653, Kaiserslautern, Germany

    Rolf Wiehagen

  4. Graduate School of Information Science and Electrical Engineering Department of Informatics, Kyushu University, Kassuga, 816-8580, Japan

    Thomas Zeugmann

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maruoka, A., Takimoto, E. (1998). Structured Weight-Based Prediction Algorithms. In: Richter, M.M., Smith, C.H., Wiehagen, R., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 1998. Lecture Notes in Computer Science(), vol 1501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49730-7_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-49730-7_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65013-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation