Sciweavers

770 search results - page 75 / 154
» Latent Class Models for Algorithm Portfolio Methods
Sort
View
ACL
2003
14 years 11 months ago
Accurate Unlexicalized Parsing
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
Dan Klein, Christopher D. Manning
CIBCB
2005
IEEE
14 years 11 months ago
A Transcriptional Approach to Gene Clustering
— We present an integrative method for clustering coregulated genes and elucidating their underlying regulatory mechanisms. We use multi-state partition functions and thermodynam...
Ilias Tagkopoulos
CVPR
2004
IEEE
15 years 11 months ago
Model-Based Motion Clustering Using Boosted Mixture Modeling
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
Vladimir Pavlovic
CORR
2010
Springer
167views Education» more  CORR 2010»
14 years 9 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
UAI
2003
14 years 11 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...