15 search results - page 1 / 3 » Classes with Easily Learnable Subclasses |
ALT
2002
Springer
14 years 1 months ago
2002
Springer
In this paper we study the question of whether identifiable classes have subclasses which are identifiable under a more restrictive criterion. The chosen framework is inductive ...
ALT
2005
Springer
14 years 1 months ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
COLT
2007
Springer
13 years 11 months ago
2007
Springer
For the natural notion of splitting classes into two disjoint subclasses via a recursive classifier working on texts, the question is addressed how these splittings can look in th...
ALT
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
IJCAI
1993
13 years 6 months ago
1993
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...