Peter Geibel and Fritz Wysotzki. Induction of Context Dependent and Relational Concepts. In Proceedings of the 5th International Workshop on Inductive Logic Programming, Leuven, Belgium, 1995. to appear.  Home/Search   Document Not in Database   Summary   Related Articles

....3 of G 1 is classified as np. Generally we will assume, that a class is characterized by a whole set of defining contexts (disjunctive class) and additionally by the absence of contexts. A formal definition of a context dependent classifier for nodes that is based on defining contexts is given in [3]. Differing from [3] we will consider the decision trees that are learned by the algorithms described below, as context dependent classifiers in their own right. 3.1 Learning Context Dependent Concepts Let us now consider the induction problem for a training set 7 S = f(S 1 ; c 1 ) ....

....as np. Generally we will assume, that a class is characterized by a whole set of defining contexts (disjunctive class) and additionally by the absence of contexts. A formal definition of a context dependent classifier for nodes that is based on defining contexts is given in [3] Differing from [3] we will consider the decision trees that are learned by the algorithms described below, as context dependent classifiers in their own right. 3.1 Learning Context Dependent Concepts Let us now consider the induction problem for a training set 7 S = f(S 1 ; c 1 ) S s ; c s )g with ....

[Article contains additional citation context not shown here]

Peter Geibel and Fritz Wysotzki. Induction of Context Dependent and Relational Concepts. In Proceedings of the 5th International Workshop on Inductive Logic Programming, Leuven, Belgium, 1995. to appear.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC