Designing a Universal Suboptimal Tree Integration Algorithm

摘要

Processing hierarchical data structures, due to their increasing popularity, becomes more and more important. In our previous works we have developed many exact integration algorithms for trees, but designing a new algorithm for each new integration aim is resource consuming. In this paper we propose a universal integration method based on genetic programming heuristic. Experimental evaluation shows that this approach is slightly slower than exact algorithms and sometimes provides worse solutions. One important advantage however is that it may be applied with no additional effort to any problem, without the need for a long design phase.