Sciweavers

121 search results - page 4 / 25
» The Feature Selection Path in Kernel Methods
Sort
View
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
ICASSP
2011
IEEE
12 years 11 months ago
Generic object recognition using automatic region extraction and dimensional feature integration utilizing multiple kernel learn
Recently, in generic object recognition research, a classification technique based on integration of image features is garnering much attention. However, with a classifying techn...
Toru Nakashika, Akira Suga, Tetsuya Takiguchi, Yas...
ICASSP
2011
IEEE
12 years 11 months ago
Multiple kernel nonnegative matrix factorization
Kernel nonnegative matrix factorization (KNMF) is a recent kernel extension of NMF, where matrix factorization is carried out in a reproducing kernel Hilbert space (RKHS) with a f...
Shounan An, Jeong-Min Yun, Seungjin Choi
JMLR
2010
206views more  JMLR 2010»
13 years 2 months ago
Learning Translation Invariant Kernels for Classification
Appropriate selection of the kernel function, which implicitly defines the feature space of an algorithm, has a crucial role in the success of kernel methods. In this paper, we co...
Sayed Kamaledin Ghiasi Shirazi, Reza Safabakhsh, M...
GBRPR
2009
Springer
14 years 1 months ago
Edition within a Graph Kernel Framework for Shape Recognition
A large family of shape comparison methods is based on a medial axis transform combined with an encoding of the skeleton by a graph. Despite many qualities this encoding of shapes ...
François-Xavier Dupé, Luc Brun