Sciweavers

1351 search results - page 35 / 271
» Learning from compressed observations
Sort
View
ICML
2001
IEEE
15 years 10 months ago
Learning with the Set Covering Machine
We generalize the classical algorithms of Valiant and Haussler for learning conjunctions and disjunctions of Boolean attributes to the problem of learning these functions over arb...
Mario Marchand, John Shawe-Taylor
IJCNN
2007
IEEE
15 years 4 months ago
A Novel Weighted LBG Algorithm for Neural Spike Compression
Abstract— In this paper, we present a weighted Linde-BuzoGray algorithm (WLBG) as a powerful and efficient technique for compressing neural spike data. We compare this technique...
Sudhir Rao, António R. C. Paiva, Jose C. Pr...
ECML
2006
Springer
15 years 1 months ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
ICML
2009
IEEE
15 years 10 months ago
Interactively optimizing information retrieval systems as a dueling bandits problem
We present an on-line learning framework tailored towards real-time learning from observed user behavior in search engines and other information retrieval systems. In particular, ...
Yisong Yue, Thorsten Joachims
ICCV
2011
IEEE
13 years 10 months ago
Kernel Non-Rigid Structure from Motion
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
Paulo F. U. Gotardo, Aleix M. Martinez