Sciweavers

1227 search results - page 110 / 246
» Approximate Kernel Clustering
Sort
View
NIPS
2007
14 years 11 months ago
Convex Clustering with Exemplar-Based Models
Clustering is often formulated as the maximum likelihood estimation of a mixture model that explains the data. The EM algorithm widely used to solve the resulting optimization pro...
Danial Lashkari, Polina Golland
CVPR
2006
IEEE
15 years 12 months ago
Efficient Nonparametric Belief Propagation with Application to Articulated Body Tracking
An efficient Nonparametric Belief Propagation (NBP) algorithm is developed in this paper. While the recently proposed nonparametric belief propagation algorithm has wide applicati...
Tony X. Han, Huazhong Ning, Thomas S. Huang
JC
2011
87views more  JC 2011»
14 years 4 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
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
CORR
2010
Springer
128views Education» more  CORR 2010»
14 years 10 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff