Sciweavers

4930 search results - page 155 / 986
» Learning minimal abstractions
Sort
View
84
Voted
NIPS
2007
15 years 2 months ago
Structured Learning with Approximate Inference
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...
Alex Kulesza, Fernando Pereira
90
Voted
AAAI
2006
15 years 2 months ago
Using Homomorphisms to Transfer Options across Continuous Reinforcement Learning Domains
We examine the problem of Transfer in Reinforcement Learning and present a method to utilize knowledge acquired in one Markov Decision Process (MDP) to bootstrap learning in a mor...
Vishal Soni, Satinder P. Singh
PAMI
2011
14 years 7 months ago
Semi-Supervised Learning via Regularized Boosting Working on Multiple Semi-Supervised Assumptions
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...
Ke Chen, Shihai Wang
PAKDD
2011
ACM
473views Data Mining» more  PAKDD 2011»
14 years 6 months ago
 Finding Rare Classes: Adapting Generative and Discriminative Models in Active Learning
Discovering rare categories and classifying new instances of them is an important data mining issue in many fields, but fully supervised learning of a rare class classifier is pr...
Timothy Hospedales, Shaogang Gong and Tao Xiang
131
Voted
PAMI
2012
13 years 3 months ago
Domain Transfer Multiple Kernel Learning
—Cross-domain learning methods have shown promising results by leveraging labeled patterns from the auxiliary domain to learn a robust classifier for the target domain which has ...
Lixin Duan, Ivor W. Tsang, Dong Xu