Generalizing over Several Learning Settings

13 years 3 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many settings involving one or more of those information sources as possible and covers the whole range of combinations allowing inference with polynomial complexity. The algorithm uses the concept of an observation table as a means to perform and document the inference process at the same time.
Anna Kasprzik
Added 09 Nov 2010
Updated 09 Nov 2010
Type Conference
Year 2010
Where ICGI
Authors Anna Kasprzik
Comments (0)