By Topic

Programming model for concept learning and its solution based on genetic algorithms

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
$33 $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)
Minqiang Li ; Inst. of Syst. Eng., Tianjin Univ., China ; Jisong Kou ; Jing Zhou

Learning from examples is an important branch of inductive learning, and is also the bottleneck in concepts extraction of machine learning. Based on inductive learning theory this paper applies combinatorial optimization method to setup the programming models of learning concepts of the prepositional logic formulas in the conjunctive normal form (CNF) and disjunctive normal form (DNF). Then, genetic algorithms (GA), specified to CNF learning, is designed. GA can find the multiple optimal solution in theory and practice, and experiments reveal that it runs more efficiently compared with heuristic algorithms of the generalisation-and-specialisation (GS) type

Published in:

Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on  (Volume:1 )

Date of Conference:

2000