Skip to main content
SpringerLink
Log in

Stochastic Finite Learning

  • Reference work entry
  • First Online:
Encyclopedia of Machine Learning and Data Mining

  • 129 Accesses

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 699.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 949.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  • Angluin D (1980a) Finding patterns common to a set of strings. J Comput Syst Sci 21(1):46–62

    Article  MathSciNet  MATH  Google Scholar 

  • Angluin D (1980b) Inductive inference of formal languages from positive data. Inf Control 45(2):117–135

    Article  MathSciNet  MATH  Google Scholar 

  • Blumer A, Ehrenfeucht A, Haussler D, Warmuth MK (1989) Learnability and the Vapnik-Chervonenkis dimension. J ACM 36(4):929–965

    Article  MathSciNet  MATH  Google Scholar 

  • Erlebach T, Rossmanith P, Stadtherr H, Steger A, Zeugmann T (2001) Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries. Theor Comput Sci 261(1):119–156

    Article  MathSciNet  MATH  Google Scholar 

  • Gold EM (1967) Language identification in the limit. Inf Control 10(5):447–474

    Article  MathSciNet  MATH  Google Scholar 

  • Haussler D (1987) Bias, version spaces and Valiant’s learning framework. In: Langley P (ed) Proceedings of the fourth international workshop on machine learning. Morgan Kaufmann, San Mateo, pp 324–336

    Chapter  Google Scholar 

  • Haussler D, Kearns M, Littlestone N, Warmuth MK (1991) Equivalence of models for polynomial learnability. Inf Comput 95(2):129–161

    Article  MathSciNet  MATH  Google Scholar 

  • Lange S, Wiehagen R (1991) Polynomial-time inference of arbitrary pattern languages. New Gener Comput 8(4):361–370

    Article  MATH  Google Scholar 

  • Lange S, Zeugmann T (1996) Set-driven and rearrangement-independent learning of recursive languages. Math Syst Theory 29(6):599–634

    Article  MathSciNet  MATH  Google Scholar 

  • Mitchell A, Scheffer T, Sharma A, Stephan F (1999) The VC-dimension of subclasses of pattern languages. In: Watanabe O, Yokomori T (eds) Proceedings of the 10th international conference on algorithmic learning theory, ALT ’99, Tokyo, Dec 1999. Lecture notes in artificial intelligence, vol 1720. Springer, pp 93–105

    Google Scholar 

  • Reidenbach D (2006) A non-learnable class of E-pattern languages. Theor Comput Sci 350(1):91–102

    Article  MathSciNet  MATH  Google Scholar 

  • Reidenbach D (2008) Discontinuities in pattern inference. Theor Comput Sci 397(1–3):166–193

    Article  MathSciNet  MATH  Google Scholar 

  • Reischuk R, Zeugmann T (2000) An average-case optimal one-variable pattern language learner. J Comput Syst Sci 60(2):302–335

    Article  MathSciNet  MATH  Google Scholar 

  • Rossmanith P, Zeugmann T (2001) Stochastic finite learning of the pattern languages. Mach Learn 44(1/2): 67–91

    Article  MATH  Google Scholar 

  • Goldman SA, Kearns MJ, Schapire RE (1993) Exact identification of read-once formulas using fixed points of amplification functions. SIAM J Comput 22(4):705–726

    Article  MathSciNet  MATH  Google Scholar 

  • Valiant LG (1984) A theory of the learnable. Commun ACM 27(11):1134–1142

    Article  MATH  Google Scholar 

  • Zeugmann T (1998) Lange and Wiehagen’s pattern language learning algorithm: an average-case analysis with respect to its total learning time. Ann Math Artif Intell 23:117–145

    Article  MathSciNet  MATH  Google Scholar 

  • Zeugmann T (2006) From learning in the limit to stochastic finite learning. Theor Comput Sci 364(1):77–97. Special issue for ALT 2003

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hokkaido University, Sapporo, Japan

    Thomas Zeugmann

Authors
  1. Thomas Zeugmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thomas Zeugmann .

Editor information

Editors and Affiliations

  1. The University of New South Wales, Sydney, NSW, Australia

    Claude Sammut

  2. Faculty of Information Technology, Monash University, Melbourne, VIC, Australia

    Geoffrey I. Webb

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media New York

About this entry

Cite this entry

Zeugmann, T. (2017). Stochastic Finite Learning. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_793

Download citation

Publish with us

Policies and ethics

Search

Navigation