Sciweavers

3422 search results - page 6 / 685
» Random Subset Optimization
Sort
View
TSE
2011
144views more  TSE 2011»
14 years 4 months ago
Genetic Algorithms for Randomized Unit Testing
—Randomized testing is an effective method for testing software units. Thoroughness of randomized unit testing varies widely according to the settings of certain parameters, such...
James H. Andrews, Tim Menzies, Felix Chun Hang Li
JMLR
2010
109views more  JMLR 2010»
14 years 4 months ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
69
Voted
PAMI
1998
127views more  PAMI 1998»
14 years 9 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho
PPSN
2000
Springer
15 years 1 months ago
Practical Implications of New Results in Conservation of Optimizer Performance
Abstract. Three theoretical perspectives upon conservation of performance in function optimization are outlined. In terms of statistical information, performance is conserved when ...
Thomas M. English
WSC
2007
14 years 11 months ago
Subset selection and optimization for selecting binomial systems applied to supersaturated design generation
The problem of finding the binomial population with the highest success probability is considered when the number of binomial populations is large. A new rigorous indifference zo...
Ning Zheng, Theodore Allen