Sciweavers

1419 search results - page 4 / 284
» Approximation Methods for Supervised Learning
Sort
View
ICML
2005
IEEE
14 years 8 months ago
Supervised dimensionality reduction using mixture models
Given a classification problem, our goal is to find a low-dimensional linear transformation of the feature vectors which retains information needed to predict the class labels. We...
Sajama, Alon Orlitsky
AAAI
2010
13 years 9 months ago
Cost-Sensitive Semi-Supervised Support Vector Machine
In this paper, we study cost-sensitive semi-supervised learning where many of the training examples are unlabeled and different misclassification errors are associated with unequa...
Yu-Feng Li, James T. Kwok, Zhi-Hua Zhou
IJCAT
2010
133views more  IJCAT 2010»
13 years 6 months ago
A 3D shape classifier with neural network supervision
: The task of 3D shape classification is to assign a set of unordered shapes into pre-tagged classes with class labels, and find the most suitable class for a newly given shape. In...
Zhenbao Liu, Jun Mitani, Yukio Fukui, Seiichi Nish...
JCP
2007
143views more  JCP 2007»
13 years 7 months ago
Noisy K Best-Paths for Approximate Dynamic Programming with Application to Portfolio Optimization
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
Nicolas Chapados, Yoshua Bengio
IJCNN
2000
IEEE
13 years 12 months ago
Incremental Active Learning with Bias Reduction
The problem of designing input signals for optimal generalization in supervised learning is called active learning. In many active learning methods devised so far, the bias of the...
Masashi Sugiyama, Hidemitsu Ogawa