| Download | - View accepted manuscript: Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification (PDF, 220 KiB)
|
|---|
| Author | Search for: Turney, Peter1 |
|---|
| Affiliation | - National Research Council of Canada. NRC Institute for Information Technology
|
|---|
| Format | Text, Article |
|---|
| Conference | Fifth International Inductive Logic Programming Workshop (ILP-95), September 4-6, 1995, Leuven, Belgium |
|---|
| 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. |
|---|
| Publication date | 1995 |
|---|
| In | |
|---|
| Language | English |
|---|
| NRC number | NRCC 39164 |
|---|
| NPARC number | 8914151 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | fdcf1be9-aeeb-49e4-acad-f367cc103db4 |
|---|
| Record created | 2009-04-22 |
|---|
| Record modified | 2020-04-29 |
|---|
