Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification

Simple item page
dc.creatorTurney, Peter D.
dc.date2002-12-12
dc.date.accessioned2026-07-07T03:19:17Z
dc.date.available2026-07-07T03:19:17Z
dc.descriptionThe 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.
dc.description17 pages
dc.identifierhttps://arxiv.org/abs/cs/0212039
dc.identifierhttp://arxiv.org/abs/cs/0212039
dc.identifierProceedings of the Fifth International Inductive Logic Programming Workshop, Leuven, Belgium, (1995), 247-263
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31398
dc.subjectMachine Learning
dc.subjectNeural and Evolutionary Computing
dc.subjectI.2.6; I.2.8
dc.titleLow Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification
dc.typetext

Files

Collections

arXiv