Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification
<|reference_start|>Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification: 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.<|reference_end|>
@article{turney2002low,
    title={Low Size-Complexity Inductive Logic Programming: The East-West Challenge
  Considered as a Problem in Cost-Sensitive Classification},
    author={Peter D. Turney (National Research Council of Canada)},
    journal={Proceedings of the Fifth International Inductive Logic Programming
  Workshop, Leuven, Belgium, (1995), 247-263},
    year={2002},
    number={NRC-39164},
    archivePrefix={arXiv},
    eprint={cs/0212039},
    primaryClass={cs.LG cs.NE}
}