Lossless fitness inheritance in genetic algorithms for decision trees |
| |
Authors: | Dimitris Kalles Athanasios Papagelis |
| |
Affiliation: | (1) Hellenic Open University, Patras, Greece;(2) Open University of Cyprus, Nicosia, Cyprus;(3) Department of Computer Engineering and Informatics, University of Patras, Patras, Greece |
| |
Abstract: | When genetic algorithms are used to evolve decision trees, key tree quality parameters can be recursively computed and re-used across generations of partially similar decision trees. Simply storing instance indices at leaves is sufficient for fitness to be piecewise computed in a lossless fashion. We show the derivation of the (substantial) expected speedup on two bounding case problems and trace the attractive property of lossless fitness inheritance to the divide-and-conquer nature of decision trees. The theoretical results are supported by experimental evidence. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|