Sciweavers

159 search results - page 10 / 32
» Incremental One-Class Learning with Bounded Computational Co...
Sort
View
TNN
2010
143views Management» more  TNN 2010»
13 years 2 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...

Publication
222views
14 years 4 months ago
Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration
Abstract: Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervis...
Christos Dimitrakakis, Michail G. Lagoudakis
COLT
1993
Springer
13 years 11 months ago
Learning Binary Relations Using Weighted Majority Voting
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
Sally A. Goldman, Manfred K. Warmuth
AAAI
1994
13 years 8 months ago
Applying VC-Dimension Analysis To 3D Object Recognition from Perspective Projections
We analyze the amount of information needed to carry out model-based recognition tasks, in the context of a probabilistic data collection model, and independently of the recogniti...
Michael Lindenbaum, Shai Ben-David
PODS
2000
ACM
146views Database» more  PODS 2000»
13 years 12 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch