Sciweavers

1435 search results - page 54 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
67
Voted
IAT
2008
IEEE
15 years 7 months ago
Finding Minimum Data Requirements Using Pseudo-independence
In situations where Bayesian networks (BN) inferencing approximation is allowable, we show how to reduce the amount of sensory observations necessary and in a multi-agent context ...
Yoonheui Kim, Victor R. Lesser
ICML
2003
IEEE
16 years 1 months ago
Margin Distribution and Learning
Recent theoretical results have shown that improved bounds on generalization error of classifiers can be obtained by explicitly taking the observed margin distribution of the trai...
Ashutosh Garg, Dan Roth
104
Voted
ICPR
2008
IEEE
15 years 7 months ago
A robust front page detection algorithm for large periodical collections
Large-scale digitization projects aimed at periodicals often have as input streams of completely unlabeled document images. In such situations, the results produced by the automat...
Iuliu Vasile Konya, Christoph Seibert, Sebastian G...
100
Voted
AAAI
2000
15 years 1 months ago
Selective Sampling with Redundant Views
Selective sampling, a form of active learning, reduces the cost of labeling training data by asking only for the labels of the most informative unlabeled examples. We introduce a ...
Ion Muslea, Steven Minton, Craig A. Knoblock
81
Voted
TNN
2008
133views more  TNN 2008»
15 years 12 days ago
A General Wrapper Approach to Selection of Class-Dependent Features
In this paper, we argue that for a C-class classification problem, C 2-class classifiers, each of which discriminating one class from the other classes and having a characteristic ...
Lipo Wang, Nina Zhou, Feng Chu