Genetic programming for classification: An analysis of convergence behaviour

DOI10.1007/3-540-36187-1_27MaRDI QIDQ4415168zbMATH OpenFDO

Authors Thomas Loveard, Vic Ciesielski

Publication date 28 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2557/25570309.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Genetic programming with meta-search: Searching for a successful population within the classification domain
• On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions
• Manipulation of convergence in evolutionary systems
• Foundations of genetic programming
• Genetic programming: A review of some concerns

Cited in

(4)

• Applying genetic programming technique in classification trees
• Manipulation of convergence in evolutionary systems
• scientific article; zbMATH DE number 20220 (Why is no real title available?)
• Genetic programming with meta-search: Searching for a successful population within the classification domain

This page was built for publication: Genetic programming for classification: An analysis of convergence behaviour

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415168)