2190 search results - page 335 / 438 » Learning with the Set Covering Machine |
GPEM
2008
13 years 9 months ago
2008
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
PAMI
2010
13 years 3 months ago
2010
We propose a novel approach for activity analysis in multiple synchronized but uncalibrated static camera views. In this paper, we refer to activities as motion patterns of objects...
ECML
2001
Springer
14 years 1 months ago
2001
Springer
Labeled data for classification could often be obtained by sampling that restricts or favors choice of certain classes. A classifier trained using such data will be biased, resulti...
COLT
2005
Springer
13 years 11 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
ALT
2010
Springer
13 years 10 months ago
2010
Springer
: The ability to distinguish, differentiate and contrast between different data sets is a key objective in data mining. Such ability can assist domain experts to understand their d...