Sciweavers

455 search results - page 39 / 91
» Adaptive Sampling for Noisy Problems
Sort
View
JMLR
2010
143views more  JMLR 2010»
13 years 3 months ago
Rademacher Complexities and Bounding the Excess Risk in Active Learning
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
Vladimir Koltchinskii
PCM
2007
Springer
132views Multimedia» more  PCM 2007»
14 years 2 months ago
FADA: An Efficient Dimension Reduction Scheme for Image Classification
This paper develops a novel and efficient dimension reduction scheme--Fast Adaptive Discriminant Analysis (FADA). FADA can find a good projection with adaptation to different sampl...
Yijuan Lu, Jingsheng Ma, Qi Tian
AIPS
2009
13 years 10 months ago
Information-Theoretic Approach to Efficient Adaptive Path Planning for Mobile Robotic Environmental Sensing
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla
PAMI
2006
109views more  PAMI 2006»
13 years 8 months ago
Edge-Preserving Image Denoising and Estimation of Discontinuous Surfaces
In this paper, we are interested in the problem of estimating a discontinuous surface from noisy data. A novel procedure for this problem is proposed based on local linear kernel ...
Irène Gijbels, Alexandre Lambert, Peihua Qi...
SDM
2009
SIAM
202views Data Mining» more  SDM 2009»
14 years 6 months ago
Proximity-Based Anomaly Detection Using Sparse Structure Learning.
We consider the task of performing anomaly detection in highly noisy multivariate data. In many applications involving real-valued time-series data, such as physical sensor data a...
Tsuyoshi Idé, Aurelie C. Lozano, Naoki Abe,...