12 search results - page 1 / 3 » Exact Learning of Unordered Tree Patterns from Queries |
COLT
1999
Springer
14 years 3 months ago
1999
Springer
ALT
2003
Springer
14 years 2 months ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
IEICET
2008
13 years 11 months ago
2008
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
ALT
1995
Springer
14 years 2 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
JALC
2007
13 years 11 months ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...