Sciweavers

962 search results - page 115 / 193
» Toward Optimal Feature Selection
Sort
View
160
Voted
ICDM
2006
IEEE
225views Data Mining» more  ICDM 2006»
15 years 9 months ago
Adaptive Kernel Principal Component Analysis with Unsupervised Learning of Kernels
Choosing an appropriate kernel is one of the key problems in kernel-based methods. Most existing kernel selection methods require that the class labels of the training examples ar...
Daoqiang Zhang, Zhi-Hua Zhou, Songcan Chen
127
Voted
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
15 years 7 months ago
Convergence to global optima for genetic programming systems with dynamically scaled operators
This work shows asymptotic convergence to global optima for a family of dynamically scaled genetic programming systems where the underlying population consists of a fixed number o...
Lothar M. Schmitt, Stefan Droste
135
Voted
DIS
2010
Springer
15 years 1 months ago
Sparse Substring Pattern Set Discovery Using Linear Programming Boosting
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Mas...
137
Voted
SIGDIAL
2010
15 years 1 months ago
Sparse Approximate Dynamic Programming for Dialog Management
Spoken dialogue management strategy optimization by means of Reinforcement Learning (RL) is now part of the state of the art. Yet, there is still a clear mismatch between the comp...
Senthilkumar Chandramohan, Matthieu Geist, Olivier...
117
Voted
ICML
2006
IEEE
16 years 4 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan