A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data
[chapter]
2003
Lecture Notes in Computer Science
In order to represent structural features common to tree structured data, we propose an unlabeled term tree, which is a rooted tree pattern consisting of an unlabeled ordered tree structure and labeled variables. A variable is a labeled hyperedge which can be replaced with any unlabeled ordered tree of size at least 2. In this paper, we deal with a new kind of variable, called a contractible variable, that is an erasing variable which is adjacent to a leaf. A contractible variable can be
doi:10.1007/978-3-540-39917-9_23
fatcat:bew7ts5k4net7jdwnugybtsgxa