Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

An approach to constraint inductive logic programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lei Zheng ; Sch. of Comput. Sci., Beijing Polytech. Univ., China ; Dong Jia ; Chun-Nian Liu

A continuing problem with inductive logic programming (ILP) has proved to be difficult to handle. Constraint inductive logic programming (CILP) aims to solve this problem with ILP. We propose a new approach to CILP, and implement a prototype of CILP system called BPU-CILP. In our approach, methods from pattern recognition, such as Fisher's linear discriminant and prototype-based partitional clustering, are introduced to CILP. BPU-CILP can generate various forms of polynomial constraints in multiple dimensions, without additional background knowledge. As a result, the CLP program covering all positive examples and consisting with all negative examples can be automatically derived.

Published in:

Machine Learning and Cybernetics, 2003 International Conference on  (Volume:3 )

Date of Conference:

2-5 Nov. 2003