Sciweavers

1216 search results - page 19 / 244
» Predicting relative performance of classifiers from samples
Sort
View
AAAI
1998
13 years 9 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
HPCA
2009
IEEE
14 years 8 months ago
Versatile prediction and fast estimation of Architectural Vulnerability Factor from processor performance metrics
The shrinking processor feature size, lower threshold voltage and increasing clock frequency make modern processors highly vulnerable to transient faults. Architectural Vulnerabil...
Lide Duan, Bin Li, Lu Peng
ECML
2007
Springer
14 years 1 months ago
Neighborhood-Based Local Sensitivity
Abstract. We introduce a nonparametric model for sensitivity estimation which relies on generating points similar to the prediction point using its k nearest neighbors. Unlike most...
Paul N. Bennett
JCB
2002
70views more  JCB 2002»
13 years 7 months ago
Strong Feature Sets from Small Samples
For small samples, classi er design algorithms typically suffer from over tting. Given a set of features, a classi er must be designed and its error estimated. For small samples, ...
Seungchan Kim, Edward R. Dougherty, Junior Barrera...
TSE
2008
129views more  TSE 2008»
13 years 7 months ago
Classifying Software Changes: Clean or Buggy?
This paper introduces a new technique for predicting latent software bugs, called change classification. Change classification uses a machine learning classifier to determine wheth...
Sunghun Kim, E. James Whitehead Jr., Yi Zhang 0001