15 search results - page 1 / 3 » Classes with Easily Learnable Subclasses |
87
Voted
ALT
2002
Springer
15 years 10 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 ...
114
Voted
ALT
2005
Springer
15 years 10 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...
86
Voted
COLT
2007
Springer
15 years 7 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...
127
Voted
ALT
2006
Springer
15 years 10 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 ...
130
Voted
IJCAI
1993
15 years 2 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...