Frequency prediction of functions

Kaspars Balodis; Ilja Kucevalovs; Rusiņš Freivalds

doi:10.1007/978-3-642-25929-6_7

Frequency prediction of functions

Kaspars Balodis^*
, Ilja Kucevalovs
, Rusiņš Freivalds

^*Corresponding author for this work

University of Latvia

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

4 Citations (Scopus)

Abstract

Prediction of functions is one of processes considered in inductive inference. There is a "black box" with a given total function f in it. The result of the inductive inference machine F(<f(0), f(1),..,f(n)>) is expected to be f(n+1). Deterministic and probabilistic prediction of functions has been widely studied. Frequency computation is a mechanism used to combine features of deterministic and probabilistic algorithms. Frequency computation has been used for several types of inductive inference, especially, for learning via queries. We study frequency prediction of functions and show that that there exists an interesting hierarchy of predictable classes of functions.

Original language	English
Title of host publication	Mathematical and Engineering Methods in Computer Science - 7th International Doctoral Workshop, MEMICS 2011, Revised Selected Papers
Pages	76-83
Number of pages	8
DOIs	https://doi.org/10.1007/978-3-642-25929-6_7
Publication status	Published - 2012
Event	7th International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2011 - Lednice, Czech Republic Duration: 14 Oct 2011 → 16 Oct 2011

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7119 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	7th International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2011
Country/Territory	Czech Republic
City	Lednice
Period	14/10/11 → 16/10/11

Access to Document

10.1007/978-3-642-25929-6_7

Cite this

Balodis, K., Kucevalovs, I., & Freivalds, R. (2012). Frequency prediction of functions. In Mathematical and Engineering Methods in Computer Science - 7th International Doctoral Workshop, MEMICS 2011, Revised Selected Papers (pp. 76-83). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7119 LNCS). https://doi.org/10.1007/978-3-642-25929-6_7

Balodis, Kaspars ; Kucevalovs, Ilja ; Freivalds, Rusiņš. / Frequency prediction of functions. Mathematical and Engineering Methods in Computer Science - 7th International Doctoral Workshop, MEMICS 2011, Revised Selected Papers. 2012. pp. 76-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{c34055bd66f74d12aa6f3add6837e8d5,

title = "Frequency prediction of functions",

abstract = "Prediction of functions is one of processes considered in inductive inference. There is a {"}black box{"} with a given total function f in it. The result of the inductive inference machine F() is expected to be f(n+1). Deterministic and probabilistic prediction of functions has been widely studied. Frequency computation is a mechanism used to combine features of deterministic and probabilistic algorithms. Frequency computation has been used for several types of inductive inference, especially, for learning via queries. We study frequency prediction of functions and show that that there exists an interesting hierarchy of predictable classes of functions.",

author = "Kaspars Balodis and Ilja Kucevalovs and Rusiņ{\v s} Freivalds",

year = "2012",

doi = "10.1007/978-3-642-25929-6\_7",

language = "English",

isbn = "9783642259289",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "76--83",

booktitle = "Mathematical and Engineering Methods in Computer Science - 7th International Doctoral Workshop, MEMICS 2011, Revised Selected Papers",

note = "7th International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2011 ; Conference date: 14-10-2011 Through 16-10-2011",

}

Balodis, K, Kucevalovs, I & Freivalds, R 2012, Frequency prediction of functions. in Mathematical and Engineering Methods in Computer Science - 7th International Doctoral Workshop, MEMICS 2011, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7119 LNCS, pp. 76-83, 7th International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2011, Lednice, Czech Republic, 14/10/11. https://doi.org/10.1007/978-3-642-25929-6_7

Frequency prediction of functions. / Balodis, Kaspars; Kucevalovs, Ilja; Freivalds, Rusiņš.
Mathematical and Engineering Methods in Computer Science - 7th International Doctoral Workshop, MEMICS 2011, Revised Selected Papers. 2012. p. 76-83 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7119 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference paper › Research › peer-review

TY - GEN

T1 - Frequency prediction of functions

AU - Balodis, Kaspars

AU - Kucevalovs, Ilja

AU - Freivalds, Rusiņš

PY - 2012

Y1 - 2012

N2 - Prediction of functions is one of processes considered in inductive inference. There is a "black box" with a given total function f in it. The result of the inductive inference machine F() is expected to be f(n+1). Deterministic and probabilistic prediction of functions has been widely studied. Frequency computation is a mechanism used to combine features of deterministic and probabilistic algorithms. Frequency computation has been used for several types of inductive inference, especially, for learning via queries. We study frequency prediction of functions and show that that there exists an interesting hierarchy of predictable classes of functions.

AB - Prediction of functions is one of processes considered in inductive inference. There is a "black box" with a given total function f in it. The result of the inductive inference machine F() is expected to be f(n+1). Deterministic and probabilistic prediction of functions has been widely studied. Frequency computation is a mechanism used to combine features of deterministic and probabilistic algorithms. Frequency computation has been used for several types of inductive inference, especially, for learning via queries. We study frequency prediction of functions and show that that there exists an interesting hierarchy of predictable classes of functions.

UR - https://www.scopus.com/pages/publications/84856933109

U2 - 10.1007/978-3-642-25929-6_7

DO - 10.1007/978-3-642-25929-6_7

M3 - Conference paper

AN - SCOPUS:84856933109

SN - 9783642259289

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 76

EP - 83

BT - Mathematical and Engineering Methods in Computer Science - 7th International Doctoral Workshop, MEMICS 2011, Revised Selected Papers

T2 - 7th International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2011

Y2 - 14 October 2011 through 16 October 2011

ER -

Balodis K, Kucevalovs I, Freivalds R. Frequency prediction of functions. In Mathematical and Engineering Methods in Computer Science - 7th International Doctoral Workshop, MEMICS 2011, Revised Selected Papers. 2012. p. 76-83. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-25929-6_7

Frequency prediction of functions

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this