Sciweavers

197 search results - page 11 / 40
» A regularization framework for multiple-instance learning
Sort
View
NIPS
2008
13 years 9 months ago
Regularized Learning with Networks of Features
For many supervised learning problems, we possess prior knowledge about which features yield similar information about the target variable. In predicting the topic of a document, ...
Ted Sandler, John Blitzer, Partha Pratim Talukdar,...
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
13 years 9 months ago
Adaptive Informative Sampling for Active Learning
Many approaches to active learning involve periodically training one classifier and choosing data points with the lowest confidence. An alternative approach is to periodically cho...
Zhenyu Lu, Xindong Wu, Josh Bongard
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
14 years 2 months ago
Sparse Least-Squares Methods in the Parallel Machine Learning (PML) Framework
—We describe parallel methods for solving large-scale, high-dimensional, sparse least-squares problems that arise in machine learning applications such as document classificatio...
Ramesh Natarajan, Vikas Sindhwani, Shirish Tatikon...
PAMI
2011
13 years 2 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
ITA
2007
101views Communications» more  ITA 2007»
13 years 7 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau