Turney, Peter (1995) Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification. [Conference Paper]
Full text available as:
| PDF 84Kb |
Abstract
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a challenge was issued "to the international computing community" to discover low size-complexity Prolog programs for classifying trains. The challenge was based on a problem first proposed by Ryszard Michalski, 20 years ago. We interpreted the challenge as a problem in cost-sensitive classification and we applied a recently developed cost-sensitive classifier to the competition. Our algorithm was relatively successful (we won a prize). This paper presents our algorithm and analyzes the results of the competition.
| Item Type: | Conference Paper |
|---|---|
| Subjects: | Computer Science > Machine Learning Computer Science > Artificial Intelligence |
| ID Code: | 2890 |
| Deposited By: | Turney, Peter |
| Deposited On: | 16 Apr 2003 |
| Last Modified: | 12 Sep 2007 17:47 |
References in Article
Select the SEEK icon to attempt to find the referenced article. If it does not appear to be in cogprints you will be forwarded to the paracite service. Poorly formated references will probably not work.
Metadata
- HTML Citation
- ASCII Citation
- EPrints Application Profile (experimental)
- ID Plus Text Citation
- OpenURL ContextObject
- EndNote
- BibTeX
- OpenURL ContextObject in Span
- MODS
- DIDL
- EP3 XML
- Dublin Core
- Reference Manager
- Eprints Application Profile
- Simple Metadata
- Refer
- METS
- Search Data Dump
Repository Staff Only: item control page

