Referenced Items are not available for this document.
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
- Page(s):
- 299 - 303 vol.1
- Meeting Date :
- 28 Jun 2000-02 Jul 2000
- Print ISBN:
- 0-7803-5995-X
- INSPEC Accession Number:
- 6741798
- Conference Location :
- Hefei
- Digital Object Identifier :
- 10.1109/WCICA.2000.859970
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
