Sciweavers

178 search results - page 14 / 36
» Extensions of Manifold Learning Algorithms in Kernel Feature...
Sort
View
KAIS
2007
97views more  KAIS 2007»
13 years 7 months ago
Stability of feature selection algorithms: a study on high-dimensional spaces
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive ...
Alexandros Kalousis, Julien Prados, Melanie Hilari...
ML
2006
ACM
121views Machine Learning» more  ML 2006»
13 years 7 months ago
Model-based transductive learning of the kernel matrix
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
Zhihua Zhang, James T. Kwok, Dit-Yan Yeung
CVPR
2010
IEEE
13 years 12 months ago
Bayes Optimal Kernel Discriminant Analysis
Kernel methods provide an efficient mechanism to derive nonlinear algorithms. In classification problems as well as in feature extraction, kernel-based approaches map the original...
Di You, Aleix Martinez
ICML
2006
IEEE
14 years 8 months ago
Kernelizing the output of tree-based methods
We extend tree-based methods to the prediction of structured outputs using a kernelization of the algorithm that allows one to grow trees as soon as a kernel can be defined on the...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
ICML
2004
IEEE
14 years 8 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu