Quantifying Prior Determination Knowledge Using the PAC Learning Model |
| |
Authors: | Mahadevan Sridhar Tadepalli Prasad |
| |
Affiliation: | (1) Department of Computer Science and Engineering, University of South Florida, 33620 Tampa, FL;(2) Department of Computer Science, Oregon State University, 97331 Corvallis, OR |
| |
Abstract: | Prior knowledge, or bias, regarding a concept can reduce the number of examples needed to learn it. Probably Approximately Correct (PAC) learning is a mathematical model of concept learning that can be used to quantify the reduction in the number of examples due to different forms of bias. Thus far, PAC learning has mostly been used to analyzesyntactic bias, such as limiting concepts to conjunctions of boolean prepositions. This paper demonstrates that PAC learning can also be used to analyzesemantic bias, such as a domain theory about the concept being learned. The key idea is to view the hypothesis space in PAC learning as that consistent withall prior knowledge, syntactic and semantic. In particular, the paper presents an analysis ofdeterminations, a type of relevance knowledge. The results of the analysis reveal crisp distinctions and relations among different determinations, and illustrate the usefulness of an analysis based on the PAC learning model. |
| |
Keywords: | Determinations PAC learning bias prior knowledge incomplete theories |
本文献已被 SpringerLink 等数据库收录! |
|