Sciweavers

641 search results - page 13 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
BMCBI
2006
142views more  BMCBI 2006»
14 years 9 months ago
Improving the Performance of SVM-RFE to Select Genes in Microarray Data
Background: Recursive Feature Elimination is a common and well-studied method for reducing the number of attributes used for further analysis or development of prediction models. ...
Yuanyuan Ding, Dawn Wilkins
JMLR
2010
118views more  JMLR 2010»
14 years 4 months ago
On Over-fitting in Model Selection and Subsequent Selection Bias in Performance Evaluation
Model selection strategies for machine learning algorithms typically involve the numerical optimisation of an appropriate model selection criterion, often based on an estimator of...
Gavin C. Cawley, Nicola L. C. Talbot
ISCI
2007
141views more  ISCI 2007»
14 years 9 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
IEEEICCI
2006
IEEE
15 years 3 months ago
Using Feature Selection Filtering Methods for Binding Site Predictions
Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. In previous work we applied classification techniques on predictio...
Yi Sun, Mark Robinson, Rod Adams, Rene te Boekhors...
84
Voted
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...