Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
AAAI
2011
10 years 5 months ago
A Feasible Nonconvex Relaxation Approach to Feature Selection
Variable selection problems are typically addressed under a penalized optimization framework. Nonconvex penalties such as the minimax concave plus (MCP) and smoothly clipped absol...
Cuixia Gao, Naiyan Wang, Qi Yu, Zhihua Zhang
JMLR
2010
126views more  JMLR 2010»
11 years 1 days ago
Ultra-high Dimensional Multiple Output Learning With Simultaneous Orthogonal Matching Pursuit: Screening Approach
We propose a novel application of the Simultaneous Orthogonal Matching Pursuit (SOMP) procedure to perform variable selection in ultra-high dimensional multiple output regression ...
Mladen Kolar, Eric P. Xing
EVOW
2009
Springer
11 years 3 months ago
Conquering the Needle-in-a-Haystack: How Correlated Input Variables Beneficially Alter the Fitness Landscape for Neural Networks
Abstract. Evolutionary algorithms such as genetic programming and grammatical evolution have been used for simultaneously optimizing network architecture, variable selection, and w...
Stephen D. Turner, Marylyn D. Ritchie, William S. ...
MA
2010
Springer
94views Communications» more  MA 2010»
11 years 3 months ago
On sparse estimation for semiparametric linear transformation models
: Semiparametric linear transformation models have received much attention due to its high flexibility in modeling survival data. A useful estimating equation procedure was recent...
Hao Helen Zhang, Wenbin Lu, Hansheng Wang
IJDAR
2010
169views more  IJDAR 2010»
11 years 3 months ago
A Bayesian network for combining descriptors: application to symbol recognition
Inthispaper,weproposeadescriptorcombination method, which enables to improve significantly the recognition rate compared to the recognition rates obtained by each descriptor. This ...
Sabine Barrat, Salvatore Tabbone
CP
2010
Springer
11 years 3 months ago
Heuristics for Planning with SAT
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...
Jussi Rintanen
SCFBM
2008
738views more  SCFBM 2008»
11 years 4 months ago
Purposeful selection of variables in logistic regression
The main problem in any model-building situation is to choose from a large set of covariates those that should be included in the "best" model. A decision to keep a vari...
Zoran Bursac, C. Heath Gauss, David Keith Williams...
MP
2007
142views more  MP 2007»
11 years 4 months ago
Active-constraint variable ordering for faster feasibility of mixed integer linear programs
The selection of the branching variable can greatly affect the speed of the branch and bound solution of a mixed-integer or integer linear program. Traditional approaches to branc...
Jagat Patel, John W. Chinneck
CSDA
2004
105views more  CSDA 2004»
11 years 5 months ago
Computational aspects of algorithms for variable selection in the context of principal components
Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...
Jorge Cadima, J. Orestes Cerdeira, Manuel Minhoto
BMCBI
2007
147views more  BMCBI 2007»
11 years 5 months ago
Bias in random forest variable importance measures: Illustrations, sources and a solution
Variable importance measures for random forests have been receiving increased attention as a means of variable selection in many classification tasks in bioinformatics and relate...
Carolin Strobl, Anne-Laure Boulesteix, Achim Zeile...
books