Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10334722 | Theoretical Computer Science | 2005 | 12 Pages |
Abstract
A sequential sampling algorithm or adaptive sampling algorithm is a sampling algorithm that obtains instances sequentially one by one and determines from these instances whether it has already seen enough number of instances for achieving a given task. In this paper, we present two typical sequential sampling algorithms. By using simple estimation problems for our example, we explain when and how to use such sampling algorithms for designing adaptive learning algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Osamu Watanabe,