Sciweavers

105 search results - page 5 / 21
» Making generative classifiers robust to selection bias
Sort
View
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
15 years 10 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
ICML
2010
IEEE
14 years 10 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
AIA
2007
14 years 11 months ago
Incremental classifier based on a local credibility criterion
In this paper we propose the Local Credibility Concept (LCC), a novel technique for incremental classifiers. It measures the classification rate of the classifier’s local mod...
Herward Prehn, Gerald Sommer
ICML
2006
IEEE
15 years 10 months ago
Pruning in ordered bagging ensembles
We present a novel ensemble pruning method based on reordering the classifiers obtained from bagging and then selecting a subset for aggregation. Ordering the classifiers generate...
Alberto Suárez, Gonzalo Martínez-Mu&...
ICMCS
2006
IEEE
131views Multimedia» more  ICMCS 2006»
15 years 3 months ago
Self-Supervised Learning for Robust Video Indexing
The performance of video analysis and indexing algorithms strongly depends on the type, content and recording characteristics of the analyzed video. Current video indexing approac...
Ralph Ewerth, Bernd Freisleben