Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Some discriminant-based PAC algorithms

Tools
- Tools
+ Tools

UNSPECIFIED (2006) Some discriminant-based PAC algorithms. In: 14th Annual Conference on Computational Learning Theory (COLT 2001)/5th European Conference on Computational Learning Theory (EuroCOLT 2001), JUL 16-19, 2001, AMSTERDAM, NETHERLANDS.

Full text not available from this repository.

Abstract

A classical approach in multi-class pattern classification is the following. Estimate the probability distributions that generated the observations for each label class, and then label new instances by applying the Bayes classifier to the estimated distributions. That approach provides more useful information than just a class label; it also provides estimates of the conditional distribution of class labels, in situations where there is class overlap. We would like to know whether it is harder to build accurate classifiers via this approach, than by techniques that may process all data with distinct labels together. In this paper we make that question precise by considering it in the context of PAC learnability. We propose two restrictions on the PAC learning framework that are intended to correspond with the above approach, and consider their relationship with standard PAC learning. Our main restriction of interest leads to some interesting algorithms that show that the restriction is not stronger (more restrictive) than various other well-known restrictions on PAC learning. An alternative slightly milder restriction turns out to be almost equivalent to unrestricted PAC learning.

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
T Technology > TL Motor vehicles. Aeronautics. Astronautics
Journal or Publication Title: JOURNAL OF MACHINE LEARNING RESEARCH
Publisher: MICROTOME PUBLISHING
ISSN: 1532-4435
Date: February 2006
Volume: 7
Number of Pages: 24
Page Range: pp. 283-306
Publication Status: Published
Title of Event: 14th Annual Conference on Computational Learning Theory (COLT 2001)/5th European Conference on Computational Learning Theory (EuroCOLT 2001)
Location of Event: AMSTERDAM, NETHERLANDS
Date(s) of Event: JUL 16-19, 2001
URI: http://wrap.warwick.ac.uk/id/eprint/33748

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us