next up previous contents
Next: Assessing success Up: Formulation of the problem Previous: Stream Set

Statement of the problem

Given these definitions, we are now in a position to define the temporal classification.

Let tex2html_wrap_inline1763 be a set of streams with the same type. Let tex2html_wrap_inline1783 be a set of labels of some kind, that describes the set of possible classes.

Define a function

displaymath1779

which takes an element of tex2html_wrap_inline1773 and returns an element of tex2html_wrap_inline1801 .

The goal is given a subset of the function tex2html_wrap_inline1785 (say tex2html_wrap_inline1803 ) produce a function tex2html_wrap_inline1805 which is a similar to tex2html_wrap_inline1785 as possiblegif.

Again, it is hard to represent the notion of ``learning'' here; and there are several intuitive aspects which the above definition does not cover. Again, the channel type means more than just that the channels have the same range; and tex2html_wrap_inline1773 is more than just a random collection of streams. tex2html_wrap_inline1773 in some ways represents a domain (in the machine learning sense) that we are interested in. It also remains for similarity to be defined. For example, if we are to continue the above example, one tex2html_wrap_inline1773 might be the set of all possible signs. tex2html_wrap_inline1817 is not just a random function, but a function that tells us what the class, or type, of a given sign is.

Intuitively, our goal is: given a limited example of streams and their classes, in other words, some subset of the function tex2html_wrap_inline1785 , say tex2html_wrap_inline1793 , can we make an estimate of tex2html_wrap_inline1785 , say tex2html_wrap_inline1797 , that is close to ? This is similar to the definition for pure inductive inference.



Mohammed Waleed Kadous
Tue Oct 6 13:04:40 EST 1998