Among the multitude of learning algorithms that can be employed for deriving quantitative structure-activity relationships, regression trees have the advantage of being able to handle large data sets, dynamically perform the key feature selection, and yield readily interpretable models. A conventional method of building a regression tree model is recursive partitioning, a fast greedy algorithm that works well in many, but not all, cases. This work introduces a novel method of data partitioning based on artificial ants. This method is shown to perform better than recursive partitioning on three well-studied data sets.
No takes yet. Share an insight, caveat, or question.
Izrailev et al. (2000) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: