Wikipedia

Sample complexity

This is an old revision of this page, as edited by Gareth Jones (talk | contribs) at 13:38, 17 July 2014 (add reference). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In machine learning, sample complexity is the number of examples needed for the estimate of a target function to be within a given size of error.[1]

References

  1. ^ Attention: This template ({{cite doi}}) is deprecated. To cite the publication identified by doi:10.1007/s10994-010-5174-y, please use {{cite journal}} (if it was published in a bona fide academic journal, otherwise {{cite report}} with |doi=10.1007/s10994-010-5174-y instead.
 

This artificial intelligence-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Sample_complexity&oldid=617313910"