Sciweavers

570 search results - page 45 / 114
» When does Co-training Work in Real Data
Sort
View
GECCO
2009
Springer
188views Optimization» more  GECCO 2009»
15 years 7 months ago
Exploiting multiple classifier types with active learning
Many approaches to active learning involve training one classifier by periodically choosing new data points about which the classifier has the least confidence, but designing a co...
Zhenyu Lu, Josh Bongard
NIPS
2007
15 years 5 months ago
Learning Bounds for Domain Adaptation
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classi...
John Blitzer, Koby Crammer, Alex Kulesza, Fernando...
131
Voted
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
16 years 4 months ago
BLOSOM: a framework for mining arbitrary boolean expressions
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
Lizhuang Zhao, Mohammed J. Zaki, Naren Ramakrishna...
122
Voted
CVPR
2008
IEEE
15 years 10 months ago
Subspace segmentation with outliers: A grassmannian approach to the maximum consensus subspace
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
Nuno Pinho da Silva, João Paulo Costeira
ICRA
2008
IEEE
114views Robotics» more  ICRA 2008»
15 years 10 months ago
Lazy localization using the Frozen-Time Smoother
— We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is ‘frozen’, in the sense that the belief always refers to th...
Andrea Censi, Gian Diego Tipaldi