Sciweavers

647 search results - page 60 / 130
» Costs of General Purpose Learning
Sort
View
ICML
2006
IEEE
14 years 9 months ago
Active sampling for detecting irrelevant features
The general approach for automatically driving data collection using information from previously acquired data is called active learning. Traditional active learning addresses the...
Sriharsha Veeramachaneni, Emanuele Olivetti, Paolo...
COLT
2004
Springer
14 years 2 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum
ICPR
2010
IEEE
13 years 9 months ago
The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround
Abstract—We point out a problem inherent in the optimization scheme of many popular feature selection methods. It follows from the implicit assumption that higher feature selecti...
Petr Somol, Jiri Grim, Pavel Pudil
CVPR
2009
IEEE
15 years 4 months ago
Multiplicative Nonnegative Graph Embedding
In this paper, we study the problem of nonnegative graph embedding, originally investigated in [14] for reaping the benefits from both nonnegative data factorization and the spe...
Changhu Wang (University of Science and Technology...
HASE
2007
IEEE
14 years 3 months ago
On the Verifiability of Programs Written in the Feature Language Extensions
High assurance in embedded system software is difficult to attain. Verification relies on testing. The unreliable and costly testing process is made much worse because the softwar...
Wu-Hon F. Leung