Sciweavers

750 search results - page 64 / 150
» Learning SVMs from Sloppily Labeled Data
Sort
View
KDD
2008
ACM
207views Data Mining» more  KDD 2008»
14 years 9 months ago
Active learning with direct query construction
Active learning may hold the key for solving the data scarcity problem in supervised learning, i.e., the lack of labeled data. Indeed, labeling data is a costly process, yet an ac...
Charles X. Ling, Jun Du
SIGIR
2009
ACM
14 years 3 months ago
Extracting structured information from user queries with semi-supervised conditional random fields
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
Xiao Li, Ye-Yi Wang, Alex Acero
ALT
2009
Springer
14 years 16 days ago
Learning and Domain Adaptation
Domain adaptation is a fundamental learning problem where one wishes to use labeled data from one or several source domains to learn a hypothesis performing well on a different, y...
Yishay Mansour
BMCBI
2010
224views more  BMCBI 2010»
13 years 9 months ago
An adaptive optimal ensemble classifier via bagging and rank aggregation with applications to high dimensional data
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
Susmita Datta, Vasyl Pihur, Somnath Datta
PAMI
2006
147views more  PAMI 2006»
13 years 9 months ago
Bayesian Gaussian Process Classification with the EM-EP Algorithm
Gaussian process classifiers (GPCs) are Bayesian probabilistic kernel classifiers. In GPCs, the probability of belonging to a certain class at an input location is monotonically re...
Hyun-Chul Kim, Zoubin Ghahramani