A note on learning from multiple-instance examples

被引:67
作者
Blum, A [1 ]
Kalai, A [1 ]
机构
[1] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
基金
美国国家科学基金会;
关键词
multiple-instance examples; classification noise; statistical queries;
D O I
10.1023/A:1007402410823
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 mole involved) reduction to the Statistical-Query model that results in a polynomial-time algorithm for learning axis-parallel rectangles with sample complexity (O) over tilde(d(2)r/epsilon(2)), saving roughly a factor of r over the results of Auer et al. (1997).
引用
收藏
页码:23 / 29
页数:7
相关论文
共 5 条
[1]  
AUER P, 1997, P 14 INT C MACH LEAR
[2]  
AUER P, 1997, IN PRESS P 29 ANN AC
[3]   Solving the multiple instance problem with axis-parallel rectangles [J].
Dietterich, TG ;
Lathrop, RH ;
LozanoPerez, T .
ARTIFICIAL INTELLIGENCE, 1997, 89 (1-2) :31-71
[4]  
Kearns M., 1993, Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, P392, DOI 10.1145/167088.167200
[5]  
Long P. M., 1996, Proceedings of the Ninth Annual Conference on Computational Learning Theory, P228, DOI 10.1145/238061.238105