Sciweavers

1018 search results - page 117 / 204
» Learning Probabilistic Models of Contours
Sort
View
ICML
2008
IEEE
15 years 10 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...
IJCV
2008
151views more  IJCV 2008»
14 years 10 months ago
Describing Visual Scenes Using Transformed Objects and Parts
We develop hierarchical, probabilistic models for objects, the parts composing them, and the visual scenes surrounding them. Our approach couples topic models originally developed...
Erik B. Sudderth, Antonio Torralba, William T. Fre...
JMLR
2006
138views more  JMLR 2006»
14 years 10 months ago
Noisy-OR Component Analysis and its Application to Link Analysis
We develop a new component analysis framework, the Noisy-Or Component Analyzer (NOCA), that targets high-dimensional binary data. NOCA is a probabilistic latent variable model tha...
Tomás Singliar, Milos Hauskrecht
JAIR
2006
137views more  JAIR 2006»
14 years 10 months ago
Learning Sentence-internal Temporal Relations
In this paper we propose a data intensive approach for inferring sentence-internal temporal relations. Temporal inference is relevant for practical NLP applications which either e...
Maria Lapata, Alex Lascarides
CVPR
2009
IEEE
16 years 5 months ago
Active Learning for Large Multi-class Problems
Scarcity and infeasibility of human supervision for large scale multi-class classification problems necessitates active learning. Unfortunately, existing active learning methods ...
Prateek Jain (University of Texas at Austin), Ashi...