Paul W. Goldberg  Home/Search
Context Related
| dcs.warwick.ac.uk/pe...fragmented.ps.gz dcs.warwick.ac.uk/~p...fragmented.ps.gz dcs.warwick.ac.uk/pub/repor...all.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dcs.warwick.ac.uk/...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate PAC-learning in a situation in which examples (consisting of an input vector and 0/1 label) have some of the components of the input vector concealed from the learner. This is a special case of Restricted Focus of Attention (RFA) learning. Our interest here is in 1-RFA learning, where only a single component of an input vector is given, for each example. We argue that 1-RFA learning merits special consideration within the wider eld of RFA learning. It is the most restrictive... (Update)
Context of citations to this paper: More
.... assumption has been that the input distribution is known to be a product distribution (with no other information given about it) In [13] we studied in detail the problem of learning linear threshold functions over the real domain in the 1 RFA setting, so that each example...
Cited by: More
Estimating a Boolean Perceptron from its Average Satisfying.. - Goldberg (Correct)
Similar documents (at the sentence level):
21.1%: Learning Fixed-dimension Linear Thresholds From Fragmented Data - Goldberg (1999) (Correct)
Active bibliography (related documents): More All
0.3: Learning Active Classifiers - Greiner, Grove, Roth (2000) (Correct)
0.3: Application of Data Decomposition to Incomplete Information.. - Latkowski (2002) (Correct)
0.2: Learning with Restricted Focus of Attention - Ben-David, Dichterman (1997) (Correct)
Similar documents based on text: More All
0.5: On Restricted-Focus-of-Attention Learnability of Boolean Functions - Birkendorf (1998) (Correct)
0.5: Learning with Limited Visibility - Dichterman (1998) (Correct)
0.3: Regional Frequency Analysis Of Extreme Water Levels Along.. - van Gelder, Neykov (1998) (Correct)
BibTeX entry: (Update)
P.W. Goldberg (1999). Learning Fixed-dimension Linear Thresholds from Fragmented Data. Warwick CS dept. tech. report RR362, Sept. 99, accepted for publication in Information and Computation as of Dec. 2000. A preliminary version is in Procs of the 1999 Conference on Computational Learning Theory, pp. 88-99 July 1999. http://citeseer.ist.psu.edu/article/goldberg99learning.html More
@inproceedings{ goldberg99learning,
author = "Goldberg",
title = "Learning Fixed-dimension Linear Thresholds from Fragmented Data",
booktitle = "{COLT}: Proceedings of the Workshop on Computational Learning Theory, Morgan Kaufmann Publishers",
year = "1999",
url = "citeseer.ist.psu.edu/article/goldberg99learning.html" }
Citations (may not include all citations):2528 Maximum Likelihood from Incomplete Data via the EM Alorithm (context) - Laird - 1977
537 A Theory of the Learnable (context) - Valiant - 1984
465 Learnability and the Vapnik-Chervonenkis Dimension (context) - Blumer, Ehrenfeucht et al. - 1989
318 Convergence of Stochastic Processes (context) - Pollard - 1984
268 Decision Theoretic Generalizations of the PAC Model for Neur.. (context) - Haussler - 1992
248 An Introduction to Computational Learning Theory (context) - Kearns, Vazirani - 1994
203 Statistical Analysis with Missing Data (context) - Rubin - 1987
157 Probability inequalities for sums of bounded random variable.. (context) - Hoe - 1963
142 Learning from noisy examples (context) - Angluin, Laird - 1988
97 Computational Learning Theory (context) - Anthony, Biggs - 1992
84 Learning disjunctions of conjunctions (context) - Valiant - 1985
59 Harmonic analysis of polynomial threshold functions (context) - Bruck - 1990
57 the Learnability of Discrete Distributions (context) - Kearns, Mansour et al. - 1994
40 Types of noise in data for concept learning (context) - Sloan - 1988
26 On learning a union of half spaces (context) - Baum - 1990
23 cient Noise-Tolerant Learning From Statistical Queries (context) - Kearns - 1993
21 Can PAC Learning Algorithms Tolerate Random Attribute Noise - Goldman, Sloan - 1995
19 cient Distribution-free Learning of Probabilistic Concepts (context) - Kearns, Schapire - 1994
18 Learning With Unreliable Boundary Queries - Blum, Chalasani et al. - 1998
17 Mathematical Theory of Probability and Statistics (context) - Von Mises - 1964
15 NoiseTolerant Distribution-Free Learning of General Geometri.. - Bshouty, Goldman et al. - 1998
12 Exact learning of discretized geometric concepts - Bshouty, Goldberg et al. - 1999
11 Almost optimal set covers in nite VCdimension (context) - Br, Goodrich - 1994
11 A mildly exponential time algorithm for approximating the nu.. (context) - Dyer, Frieze et al. - 1993
9 Learnability with restricted focus of attention guarantees n.. (context) - Ben-David, Dichterman - 1994
9 Linear Programming - Randomization and Abstract Frameworks (context) - artner, Welzl - 1996
9 On restricted-focus-of-attention learnability of Boolean fun.. - Birkendorf, Dichterman et al. - 1998
6 Comparison of Discrimination Techniques Applied to a Complex.. (context) - Titterington, Murray et al. - 1981
6 Covering numbers for real-valued function classes - Bartlett, Kulkarni et al. - 1997
6 Exploiting prior knowledge in network optimization: an illus.. (context) - Lowe, Webb - 1990
3 Learning with Limited Visibility - Dichterman - 1998
3 Learning from Examples with Unspeci ed Attribute Values (context) - Goldman, Kwek et al. - 1997
2 the characterisation of threshold functions (context) - Chow - 1961
2 An Algorithm for the Fusion of Correlated Probabilities (context) - O'Brien - 1998
1 personal communication (context) - Dichterman - 1999
1 A Discounting Method for Reducing the E ect of Distribution .. (context) - Copsey - 1998
Documents on the same site (http://www.dcs.warwick.ac.uk/people/academic/Paul.Goldberg/publications.html): More
Exact Learning of Discretized Geometric Concepts - Bshouty, Goldberg, Goldman.. (1998) (Correct)
Regression with Input-dependent Noise: A Gaussian Process.. - Goldberg, al. (1998) (Correct)
Learning Fixed-dimension Linear Thresholds From Fragmented Data - Goldberg (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC