Enter your keyword

2-s2.0-85065915347

[vc_empty_space][vc_empty_space]

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

Husein I.G.a, Sitohang B.a, Akbar S.a, Azizah F.N.a

a Institut Teknologi Bandung, School of Electrical Engineering and Informatics, Bandung, Indonesia

[vc_row][vc_column][vc_row_inner][vc_column_inner][vc_separator css=”.vc_custom_1624529070653{padding-top: 30px !important;padding-bottom: 30px !important;}”][/vc_column_inner][/vc_row_inner][vc_row_inner layout=”boxed”][vc_column_inner width=”3/4″ css=”.vc_custom_1624695412187{border-right-width: 1px !important;border-right-color: #dddddd !important;border-right-style: solid !important;border-radius: 1px !important;}”][vc_empty_space][megatron_heading title=”Abstract” size=”size-sm” text_align=”text-left”][vc_column_text]© 2018 IEEE.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.[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Author keywords” size=”size-sm” text_align=”text-left”][vc_column_text]Coherence degrees,Heuristic,Heuristic functions,Ontology matching,Optimal path finding algorithms,Repair system,Search,Search method[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Indexed keywords” size=”size-sm” text_align=”text-left”][vc_column_text]A,Alignment,Coherent mapping,Heuristic,Mapping repair,Search[/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”Funding details” size=”size-sm” text_align=”text-left”][vc_column_text][/vc_column_text][vc_empty_space][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][vc_empty_space][megatron_heading title=”DOI” size=”size-sm” text_align=”text-left”][vc_column_text]https://doi.org/10.1109/ICODSE.2018.8705812[/vc_column_text][/vc_column_inner][vc_column_inner width=”1/4″][vc_column_text]Widget Plumx[/vc_column_text][/vc_column_inner][/vc_row_inner][/vc_column][/vc_row][vc_row][vc_column][vc_separator css=”.vc_custom_1624528584150{padding-top: 25px !important;padding-bottom: 25px !important;}”][/vc_column][/vc_row]