Sciweavers

209 search results - page 28 / 42
» Analyzing the Errors of Unsupervised Learning
Sort
View
ICML
1998
IEEE
15 years 10 months ago
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
Michael J. Kearns, Yishay Mansour
AII
1992
15 years 1 months ago
Learning from Multiple Sources of Inaccurate Data
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
Ganesh Baliga, Sanjay Jain, Arun Sharma
95
Voted
CVPR
2010
IEEE
15 years 6 months ago
Supervised Translation-Invariant Sparse Coding
In this paper, we propose a novel supervised hierarchical sparse coding model based on local image descriptors for classification tasks. The supervised dictionary training is perf...
Jianchao Yang, Kai Yu, Thomas Huang
SADM
2010
173views more  SADM 2010»
14 years 4 months ago
Data reduction in classification: A simulated annealing based projection method
This paper is concerned with classifying high dimensional data into one of two categories. In various settings, such as when dealing with fMRI and microarray data, the number of v...
Tian Siva Tian, Rand R. Wilcox, Gareth M. James
AIED
2005
Springer
15 years 3 months ago
Design of Erroneous Examples for ACTIVEMATH
Abstract. The behaviorist view of learning that informs much of traditional schooling is not likely to invite students and teachers to see errors in a positive light. This is parti...
Erica Melis