A METHOD FOR COMPLEX HIERARCHICAL DATA INTEGRATION

Authors:
Marcin Maleszka;Ngoc Thanh Nguyen
Affiliations:
Institute of Informatics, Wroclaw University of Technology, Wroclaw, Poland;Institute of Informatics, Wroclaw University of Technology, Wroclaw, Poland
Venue:
Cybernetics and Systems - KNOWLEDGE PROCESSING METHODOLOGIES IN INTELLIGENT AUTONOMOUS SYSTEMS
Year:
2011

Citing 0
Cited 5

Some properties of complex tree integration criteria

ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part II
Path-Oriented integration method for complex trees

KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Approximate algorithms for solving o1 consensus problems using complex tree structure

Transactions on Computational Collective Intelligence VIII
A heuristic method for collaborative recommendation using hierarchical user profiles

ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
Using subtree agreement for complex tree integration tasks

ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The process of integrating data in a hierarchical structure is usually based on algorithms designed for one specific task; for example, for eXtendable Markup Language (XML) schema integration. In this article, a more general approach for integration of data in a hierarchical structure is proposed using a generalized tree structure called a complex tree. For this aim we define a set of criteria for integration. These criteria are completeness, precision, and optimality. A simple algorithm based on these criteria is presented and the advantages of the approach are discussed.