Sciweavers

10 search results - page 2 / 2
» Fast On-line Kernel Learning for Trees
Sort
View
UAI
2000
13 years 6 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
SBRN
2008
IEEE
13 years 11 months ago
Multi-label Text Categorization Using VG-RAM Weightless Neural Networks
In automated multi-label text categorization, an automatic categorization system should output a category set, whose size is unknown a priori, for each document under analysis. Ma...
Claudine Badue, Felipe Pedroni, Alberto Ferreira d...
ESANN
2006
13 years 6 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
ICRA
1999
IEEE
126views Robotics» more  ICRA 1999»
13 years 9 months ago
Monte Carlo Localization for Mobile Robots
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...
Frank Dellaert, Dieter Fox, Wolfram Burgard, Sebas...
ICCV
2009
IEEE
14 years 9 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...