Sciweavers

723 search results - page 12 / 145
» Computationally Efficient Transductive Machines
Sort
View
ICML
2000
IEEE
14 years 8 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
ICML
2007
IEEE
14 years 8 months ago
Efficiently computing minimax expected-size confidence regions
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
CCGRID
2009
IEEE
13 years 11 months ago
Failure-Aware Construction and Reconfiguration of Distributed Virtual Machines for High Availability Computing
In large-scale clusters and computational grids, component failures become norms instead of exceptions. Failure occurrence as well as its impact on system performance and operatio...
Song Fu
ICML
2006
IEEE
14 years 8 months ago
Learning a kernel function for classification with small training samples
When given a small sample, we show that classification with SVM can be considerably enhanced by using a kernel function learned from the training data prior to discrimination. Thi...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
ECML
2001
Springer
14 years 4 days ago
Iterative Double Clustering for Unsupervised and Semi-supervised Learning
We present a powerful meta-clustering technique called Iterative Double Clustering (IDC). The IDC method is a natural extension of the recent Double Clustering (DC) method of Slon...
Ran El-Yaniv, Oren Souroujon