@misc{cogprints2890,
           title = {Low Size-Complexity Inductive Logic Programming:
The East-West Challenge Considered as a Problem in
Cost-Sensitive Classification
},
          author = {Peter Turney},
            year = {1995},
           pages = {247--263},
             url = {http://cogprints.org/2890/},
        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.}
}

<script src="//archive-bar.soton.ac.uk/archive-bar.js"></script>