Sciweavers

1594 search results - page 53 / 319
» Fast Prediction on a Tree
Sort
View
CSDA
2008
94views more  CSDA 2008»
13 years 8 months ago
Robust model selection using fast and robust bootstrap
Robust model selection procedures control the undue influence that outliers can have on the selection criteria by using both robust point estimators and a bounded loss function wh...
Matias Salibian-Barrera, Stefan Van Aelst
INFORMS
2006
87views more  INFORMS 2006»
13 years 8 months ago
Early Estimates of the Size of Branch-and-Bound Trees
This paper intends to show that the time needed to solve mixed integer programming problems by branch and bound can be roughly predicted early in the solution process. We construc...
Gérard Cornuéjols, Miroslav Karamano...
ICRA
2009
IEEE
131views Robotics» more  ICRA 2009»
13 years 5 months ago
Fast needle insertion to minimize tissue deformation and damage
Abstract-- During needle-based procedures, transitions between tissue layers often involve puncture events that produce substantial deformation and tend to drive the needle off cou...
Mohsen Mahvash, Pierre E. Dupont
TFS
2011
194views Education» more  TFS 2011»
13 years 2 months ago
Top-Down Induction of Fuzzy Pattern Trees
Fuzzy pattern tree induction was recently introduced as a novel machine learning method for classification. Roughly speaking, a pattern tree is a hierarchical, tree-like structur...
R. Senge, Eyke Hüllermeier
ML
2000
ACM
185views Machine Learning» more  ML 2000»
13 years 7 months ago
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
Tjen-Sien Lim, Wei-Yin Loh, Yu-Shan Shih