Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Can learning in the limit be done efficiently?

From MaRDI portal
Publication:5897376
Jump to:navigation, search

DOI10.1007/B14273zbMATH Open1263.68062OpenAlexW4301133113MaRDI QIDQ5897376FDOQ5897376


Authors: Thomas Zeugmann Edit this on Wikidata


Publication date: 23 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b14273




Recommendations

  • From learning in the limit to stochastic finite learning
  • scientific article; zbMATH DE number 2083808
  • Stochastic finite learning of the pattern languages
  • Learning and classifying
  • Efficiency in the identification in the limit learning paradigm


Mathematics Subject Classification ID

Computational learning theory (68Q32)



Cited In (4)

  • Efficiency in the identification in the limit learning paradigm
  • Algorithms for learning regular expressions from positive data
  • From learning in the limit to stochastic finite learning
  • Title not available (Why is that?)





This page was built for publication: Can learning in the limit be done efficiently?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897376)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5897376&oldid=16693385"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 17:37. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki