Abstract

A new genetic inductive logic programming (GILP for short) algorithm named PT-NFF-GILP (Phase Transition and New Fitness Function based Genetic Inductive Logic Programming) is proposed in this paper. Based on phase transition of the covering test, PT-NFF-GILP randomly generates initial population in phase transition region instead of the whole space of candidate clauses. Moreover, a new fitness function, which not only considers the number of examples covered by rules, but also considers the ratio of the examples covered by rules to the training examples, is defined in PT-NFF-GILP. The new fitness function measures the quality of firstorder rules more precisely, and enhances the search performance of algorithm. Experiments on ten learning problems show that: 1) the new method of generating initial population can effectively reduce iteration number and enhance predictive accuracy of GILP algorithm; 2) the new fitness function measures the quality of first-order rules more precisely and avoids generating over-specific hypothesis; 3) The performance of PT-NFF-GILP is better than other algorithms compared with it, such as G-NET, KFOIL and NFOIL.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.