Sciweavers

3256 search results - page 431 / 652
» Learning Linear Transformations
Sort
View
ICML
2010
IEEE
15 years 7 months ago
Random Spanning Trees and the Prediction of Weighted Graphs
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
CORR
2010
Springer
70views Education» more  CORR 2010»
15 years 6 months ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach
CORR
2010
Springer
253views Education» more  CORR 2010»
15 years 6 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
JIIS
2006
73views more  JIIS 2006»
15 years 6 months ago
Using KCCA for Japanese-English cross-language information retrieval and document classification
Kernel Canonical Correlation Analysis (KCCA) is a method of correlating linear relationship between two variables in a kernel defined feature space. A machine learning algorithm b...
Yaoyong Li, John Shawe-Taylor
PRL
2008
133views more  PRL 2008»
15 years 6 months ago
Better multiclass classification via a margin-optimized single binary problem
We develop a new multiclass classification method that reduces the multiclass problem to a single binary classifier (SBC). Our method constructs the binary problem by embedding sm...
Ran El-Yaniv, Dmitry Pechyony, Elad Yom-Tov