136 search results - page 10 / 28 » Learning probabilistic models of tree edit distance |
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
We present a probabilistic model for clustering of objects represented via pairwise dissimilarities. We propose that even if an underlying vectorial representation exists, it is b...
ECML
2007
Springer
15 years 4 months ago
2007
Springer
Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a littl...
NAACL
2010
14 years 7 months ago
2010
The goal of this work is to integrate query similarity metrics as features into a dense model that can be trained on large amounts of query log data, in order to rank query rewrit...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
JMLR
2006
14 years 9 months ago
2006
This paper proposes a general probabilistic framework for shape-based modeling and classification of waveform data. A segmental hidden Markov model (HMM) is used to characterize w...