Practical algorithms for on-line sampling
| dc.creator | Domingo, Carlos | |
| dc.creator | Gavalda, Ricard | |
| dc.creator | Watanabe, Osamu | |
| dc.date | 1998-09-30 | |
| dc.date.accessioned | 2026-07-07T03:23:42Z | |
| dc.date.available | 2026-07-07T03:23:42Z | |
| dc.description | One of the core applications of machine learning to knowledge discovery consists on building a function (a hypothesis) from a given amount of data (for instance a decision tree or a neural network) such that we can use it afterwards to predict new instances of the data. In this paper, we focus on a particular situation where we assume that the hypothesis we want to use for prediction is very simple, and thus, the hypotheses class is of feasible size. We study the problem of how to determine which of the hypotheses in the class is almost the best one. We present two on-line sampling algorithms for selecting hypotheses, give theoretical bounds on the number of necessary examples, and analize them exprimentally. We compare them with the simple batch sampling approach commonly used and show that in most of the situations our algorithms use much fewer number of examples. | |
| dc.description | To appear in the Proc. of Discovery Science '98, Dec. 1998 | |
| dc.identifier | https://arxiv.org/abs/cs/9809122 | |
| dc.identifier | http://arxiv.org/abs/cs/9809122 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33049 | |
| dc.subject | Machine Learning | |
| dc.subject | Data Structures and Algorithms | |
| dc.subject | I.2.6;H.2.8 | |
| dc.title | Practical algorithms for on-line sampling | |
| dc.type | text |