Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adams, E.N.: N-Trees as Nestings: Complexity, Similarity, and Consensus. Journal of Classification 3, 299–317 (1986)
Barthelemy, J.P., McMorris, F.R.: The Median Procedure for n-Trees. Journal of Classification 3, 329–334 (1986)
Boryczka, U., Dworak, K.: Cryptanalysis of transposition cipher using evolutionary algorithms. In: Hwang, D., Jung, J.J., Nguyen, N.-T. (eds.) ICCCI 2014. LNCS, vol. 8733, pp. 623–632. Springer, Heidelberg (2014)
Davis, L.: Handbook of genetic algorithms, vol. 115. Van Nostrand Reinhold, New York (1991)
Day, W.H.E.: Optimal Algorithms for Comparing Trees with Labeled Leaves. Journal of Classification 2, 7–28 (1985)
Do, H.-H., Melnik, S., Rahm, E.: Comparison of schema matching evaluations. In: Chaudhri, A.B., Jeckle, M., Rahm, E., Unland, R. (eds.) NODe-WS 2002. LNCS, vol. 2593, pp. 221–237. Springer, Heidelberg (2003)
Grefenstette, J., Gopal, R., Rosmaita, B., Van Gucht, D.: Genetic algorithms for the traveling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms and their Applications, pp. 160–168. Lawrence Erlbaum, New Jersey (1985)
Juszczuk, P.: Finding optimal strategies in the coordination games. In: Hwang, D., Jung, J.J., Nguyen, N.-T. (eds.) ICCCI 2014. LNCS, vol. 8733, pp. 613–622. Springer, Heidelberg (2014)
Maleszka, M., Nguyen, N.T.: Approximate Algorithms for Solving O1 Consensus Problems Using Complex Tree Structure. T. Computational Collective Intelligence 8, 214–227 (2012)
Maleszka, M., Nguyen, N.T.: Path-oriented integration method for complex trees. In: Jezic, G., Kusek, M., Nguyen, N.-T., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2012. LNCS, vol. 7327, pp. 84–93. Springer, Heidelberg (2012)
Maleszka, M., Mianowska, B., Nguyen, N.-T.: A heuristic method for collaborative recommendation using hierarchical user profiles. In: Nguyen, N.-T., Hoang, K., Jȩdrzejowicz, P. (eds.) ICCCI 2012, Part I. LNCS, vol. 7653, pp. 11–20. Springer, Heidelberg (2012)
Marcin, M., Nguyen, N.T.: A Method for Complex Hierarchical Data Integration. Cybernetics and Systems 42(5), 358–378 (2011)
Nguyen, N.T.: Advanced Methods for Inconsistent Knowledge Management. Springer, London (2008)
Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. The VLDB Journal 10, 334–350 (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Maleszka, M. (2015). Designing a Universal Suboptimal Tree Integration Algorithm. In: Núñez, M., Nguyen, N., Camacho, D., Trawiński, B. (eds) Computational Collective Intelligence. Lecture Notes in Computer Science(), vol 9330. Springer, Cham. https://doi.org/10.1007/978-3-319-24306-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-24306-1_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24305-4
Online ISBN: 978-3-319-24306-1
eBook Packages: Computer ScienceComputer Science (R0)