Building optimal regression tree by ant colony system–genetic algorithm: Application to modeling of melting points

The classification and regression trees (CART) possess the advantage of being able to handle large data sets and yield readily interpretable models. A conventional method of building a regression tree is recursive partitioning, which results in a good but not optimal tree. Ant colony system (ACS), which is a meta-heuristic algorithm and derived from the observation of real ants, can be used to overcome this problem. The purpose of this study was to explore the use of CART and its combination with ACS for modeling of melting points of a large variety of chemical compounds. Genetic algorithm (GA) operators (e.g., cross averring and mutation operators) were combined with ACS algorithm to select the best solution model. In addition, at each terminal node of the resulted tree, variable selection was done by ACS–GA algorithm to build an appropriate partial least squares (PLS) model. To test the ability of the resulted tree, a set of approximately 4173 structures and their melting points were used (3000 compounds as training set and 1173 as validation set). Further, an external test set containing of 277 drugs was used to validate the prediction ability of the tree. Comparison of the results obtained from both trees showed that the tree constructed by ACS–GA algorithm performs better than that produced by recursive partitioning procedure.

.Figure optionsDownload as PowerPoint slideHighlights
► Ant colony systems help to build optimum classification and regression trees.
► Using of genetic algorithm operators in ant colony systems resulted in more appropriate models.
► Variable selection in each terminal node of the tree gives promising results.
► CART–ACS–GA could model the melting point of organic materials with prediction errors lower than previous models.