Optimal Path Finding Algorithm Using Weighted Based Heuristic for Incoherent Mapping Repair

摘要

Coherent mapping becomes important resources in ontology matching process. A process called mapping repair is carried out to ensure the output alignment does not contain incoherent mapping. The goal of repair is to change the incoherent alignment into coherent alignment by removing some unwanted mapping from the alignment. The removal of mapping should be as minimal as possible in order to avoid a major change in input alignment. This article aims to build a mapping repair system that restore incoherent into coherent mapping (or alignment). This study implements mapping weighting as the heuristic function and A* Search method to produce coherent output alignment. Some experiments were conducted, the results showed that proposed system can produce output alignment with zero conflict and 100% coherence degree.