Sciweavers

30 search results - page 5 / 6
» An Algorithmic Theory of Learning: Robust Concepts and Rando...
Sort
View
SBIA
2004
Springer
13 years 11 months ago
Learning with Drift Detection
Abstract. Most of the work in machine learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Pedro Medas, Gladys Castillo, Pe...
MIR
2004
ACM
171views Multimedia» more  MIR 2004»
13 years 11 months ago
Mean version space: a new active learning method for content-based image retrieval
In content-based image retrieval, relevance feedback has been introduced to narrow the gap between low-level image feature and high-level semantic concept. Furthermore, to speed u...
Jingrui He, Hanghang Tong, Mingjing Li, HongJiang ...
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 6 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
ECML
2007
Springer
13 years 12 months ago
Stability Based Sparse LSI/PCA: Incorporating Feature Selection in LSI and PCA
The stability of sample based algorithms is a concept commonly used for parameter tuning and validity assessment. In this paper we focus on two well studied algorithms, LSI and PCA...
Dimitrios Mavroeidis, Michalis Vazirgiannis
ECCV
2008
Springer
14 years 7 months ago
Compressive Sensing for Background Subtraction
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
Volkan Cevher, Aswin C. Sankaranarayanan, Marco F....