Sciweavers

1247 search results - page 139 / 250
» A Generalization of Jumps and Labels
Sort
View
EMNLP
2006
14 years 11 months ago
Loss Minimization in Parse Reranking
We propose a general method for reranker construction which targets choosing the candidate with the least expected loss, rather than the most probable candidate. Different approac...
Ivan Titov, James Henderson
NIPS
2004
14 years 11 months ago
An Application of Boosting to Graph Classification
This paper presents an application of Boosting for classifying labeled graphs, general structures for modeling a number of real-world data, such as chemical compounds, natural lan...
Taku Kudo, Eisaku Maeda, Yuji Matsumoto
NIPS
2004
14 years 11 months ago
Semi-Markov Conditional Random Fields for Information Extraction
We describe semi-Markov conditional random fields (semi-CRFs), a conditionally trained version of semi-Markov chains. Intuitively, a semiCRF on an input sequence x outputs a "...
Sunita Sarawagi, William W. Cohen
NIPS
2001
14 years 11 months ago
Grammatical Bigrams
Unsupervised learning algorithms have been derived for several statistical models of English grammar, but their computational complexity makes applying them to large data sets int...
Mark A. Paskin
UAI
2004
14 years 11 months ago
Maximum Entropy for Collaborative Filtering
Within the task of collaborative filtering two challenges for computing conditional probabilities exist. First, the amount of training data available is typically sparse with resp...
C. Lawrence Zitnick, Takeo Kanade