Prediction of the next value of a function
dc.contributor.author | Podnieks, Karlis | |
dc.date.accessioned | 2013-08-02T06:13:51Z | |
dc.date.available | 2013-08-03T00:00:03Z | |
dc.date.issued | 1981 | |
dc.description.abstract | The following model of inductive inference is considered. Arbitrary set tau = {tau_1, tau_2, ..., tau_n} of n total functions N->N is fixed. A "black box" outputs the values f(0), f(1), ..., f(m), ... of some function f from the set tau. Processing these values by some algorithm (a strategy) we try to predict f(m+1) from f(0), f(1), ..., f(m). Upper and lower bounds for average error numbers are obtained for prediction by using deterministic and probabilistic strategies. | en_US |
dc.identifier.citation | Karlis Podnieks. Prediction of the next value of a function. Izvestija Vyssh. Uchebn. Zaved. Matematika, 1981, N5, pp. 71-77 (in Russian) | en_US |
dc.identifier.uri | https://dspace.lu.lv/dspace/handle/7/1464 | |
dc.language.iso | rus | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | inductive inference | en_US |
dc.subject | prediction | en_US |
dc.subject | probabilistic | en_US |
dc.subject | upper bounds | en_US |
dc.subject | lower bounds | en_US |
dc.subject | next value | en_US |
dc.subject | deterministic | en_US |
dc.subject | error number | en_US |
dc.subject | average | en_US |
dc.subject | strategy | en_US |
dc.title | Prediction of the next value of a function | en_US |
dc.type | Article | en_US |