(Enter summary)
Abstract: We describe a simple reduction from the problem of PAC-learning from multiple-instance examples
to that of PAC-learning with one-sided random classification noise. Thus, all concept classes
learnable with one-sided noise, which includes all concepts learnable in the usual 2-sided random
noise model plus others such as the parity function, are learnable from multiple-instance examples.
We also describe a more efficient (and somewhat technically more involved) reduction to
the Statistical-Query... (Update)
Cited by: More
Multi-Instance Learning Based Web Mining - Zhi-Hua Zhou Kai
(Correct)
Ensembles of Multi-Instance Learners - Zhou, Zhang (2003)
(Correct)
Semi-Supervised Training of Models for Appearance-Based.. - Rosenberg (2004)
(Correct)
Similar documents (at the sentence level):
77.7%: A Note on Learning from Multiple-Instance Examples - Blum, Kalai (1998)
(Correct)
Active bibliography (related documents): More All
0.1: Exploring Applications of Learning Theory to Pattern Matching and.. - Scott (1998)
(Correct)
0.1: Agnostic Learning of Geometric Patterns - Goldman, Kwek, Scott (1997)
(Correct)
0.1: Dynamic Adjustment of TCP Acknowledgment Delays - In
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:
0.0: Unknown -
(Correct)
Related documents from co-citation: More All
13: Solving the multipleinstance problem with axis-parallel rectangles
- Dietterich, Lathrop et al. - 1997
11: On learning from multi-instance examples: Empirical evaluation of a theoretical ..
- Auer - 1997
11: Multiple-Instance Learning for Natural Scene Classification
- Maron, LakshmiRatan - 1998
BibTeX entry: (Update)
A. Blum and A. Kalai. A Note on Learning from Multiple-Instance Examples. To appear in Machine Learning, 1998. http://citeseer.ist.psu.edu/blum98note.html More
@article{ blum98note,
author = "Avrim Blum and Adam Kalai",
title = "A Note on Learning from Multiple-Instance Examples",
journal = "Machine Learning",
volume = "30",
number = "1",
pages = "23-29",
year = "1998",
url = "citeseer.ist.psu.edu/blum98note.html" }
Citations (may not include all citations):
107
Efficient noise-tolerant learning from statistical queries
- Kearns - 1993
79
Solving the multiple-instance problem with axis-parallel rec..
- Dietterich, Lanthrop et al. - 1997
22
On learning from multi-instance examples: Empirical evaluati..
- Auer - 1997
19
Approximating hyper-rectangles: Learning and pseudo-random s..
- Auer, Long et al. - 1997
18
PAC learning axis-aligned rectangles with respect to product.. (context) - Long, Tan - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~avrim/Papers/pubs.html): More
Linear Approximation of Shortest Superstrings - Blum, Jiang, Li, Tromp.. (1991)
(Correct)
Universal Portfolios With and Without Transaction Costs - Blum, Kalai (1997)
(Correct)
A Constant-factor Approximation Algorithm for the k-MST Problem - Blum, Ravi, Vempala (1996)
(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