79 search results - page 10 / 16 » The pq-gram distance between ordered labeled trees |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In semi-supervised classification boosting, a similarity measure is demanded in order to measure the distance between samples (both labeled and unlabeled). However, most of the e...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
CLASSIFICATION
2008
13 years 7 months ago
2008
: In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the ama...
ACL
2009
13 years 5 months ago
2009
We present a novel transition system for dependency parsing, which constructs arcs only between adjacent words but can parse arbitrary non-projective trees by swapping the order o...