PAC Learning from Positive Statistical Queries

  • FranÇois Denis
Conference paper

DOI: 10.1007/3-540-49730-7_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1501)
Cite this paper as:
Denis F. (1998) PAC Learning from Positive Statistical Queries. In: Richter M.M., Smith C.H., Wiehagen R., Zeugmann T. (eds) Algorithmic Learning Theory. ALT 1998. Lecture Notes in Computer Science, vol 1501. Springer, Berlin, Heidelberg

Abstract

Learning from positive examples occurs very frequently in natural learning. The PAC learning model of Valiant takes many features of natural learning into account,but in most cases it fails to describe such kind of learning. We show that in order to make the learning from positive data possible, extra-information about the underlying distribution must be provided to the learner. We define a PAC learning model from positive and unlabeled examples. We also define a PAC learning model from positive and unlabeled statistical queries.Relations with PAC model ([Val84]), statistical query model ([Kea93]) and constant-partition classification noise model ([Dec97]) are studied. We show that k DNF and k decision lists are learnable in both models, i.e. with far less information than it is assumed in previously used algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • FranÇois Denis
    • 1
  1. 1.Bât. M3, LIFL, Université de Lille IVilleneuve d’Ascq CedexFrance

Personalised recommendations