Sciweavers

2996 search results - page 66 / 600
» Numberings and Randomness
Sort
View
IJCNN
2007
IEEE
14 years 4 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar
BMCBI
2007
147views more  BMCBI 2007»
13 years 10 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...
CVPR
2007
IEEE
14 years 12 months ago
Optimizing Distribution-based Matching by Random Subsampling
We boost the efficiency and robustness of distributionbased matching by random subsampling which results in the minimum number of samples required to achieve a specified probabili...
Alex Po Leung, Shaogang Gong
ITIIS
2010
131views more  ITIIS 2010»
13 years 8 months ago
The Analysis of Random Propagating Worms using Network Bandwidth
There is a well-defined propagation model, named the random constant spread (RCS) model, which explains worms that spread their clones with a random scanning strategy. This model ...
Kwangsun Ko, Hyun-Su Jang, Byuong Woon Park, Young...
STOC
2006
ACM
83views Algorithms» more  STOC 2006»
14 years 10 months ago
A randomized polynomial-time simplex algorithm for linear programming
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
Jonathan A. Kelner, Daniel A. Spielman