Identifying and eliminating inconsistencies in mappings across hierarchical ontologies

Bhavesh Sanghvi, Neeraj Koul, Vasant Honavar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Many applications require the establishment of mappings between ontologies. Such mappings are established by domain experts or automated tools. Errors in mappings can introduce inconsistencies in the resulting combined ontology. We consider the problem of identifying the largest consistent subset of mappings in hierarchical ontologies. We consider mappings that assert that a concept in one ontology is a subconcept, superconcept, or equivalent concept of a concept in another ontology and show that even in this simple setting, the task of identifying the largest consistent subset is NP-hard. We explore several polynomial time algorithms for finding suboptimal solutions including a heuristic algorithm to this problem. We experimentally compare the algorithms using several synthetic as well as real-world ontologies and mappings.

Original languageEnglish (US)
Title of host publicationOn the Move to Meaningful Internet Systems, OTM 2010 - Confederated International Conferences
Subtitle of host publicationCoopIS, IS, DOA and ODBASE, Proceedings
Pages999-1008
Number of pages10
EditionPART 2
DOIs
StatePublished - Dec 16 2010
Event9th Confederated International Conferences on On the Move to Meaningful Internet Systems, OTM 2010: CoopIS 2010, IS 2010, DOA 2010 and ODBASE 2010 - Crete, Greece
Duration: Jan 25 2010Jan 29 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6427 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th Confederated International Conferences on On the Move to Meaningful Internet Systems, OTM 2010: CoopIS 2010, IS 2010, DOA 2010 and ODBASE 2010
CountryGreece
CityCrete
Period1/25/101/29/10

Fingerprint

Inconsistency
Ontology
Subset
Heuristic algorithms
Set theory
Heuristic algorithm
Polynomial-time Algorithm
NP-complete problem
Polynomials
Concepts

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sanghvi, B., Koul, N., & Honavar, V. (2010). Identifying and eliminating inconsistencies in mappings across hierarchical ontologies. In On the Move to Meaningful Internet Systems, OTM 2010 - Confederated International Conferences: CoopIS, IS, DOA and ODBASE, Proceedings (PART 2 ed., pp. 999-1008). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6427 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-16949-6_24
Sanghvi, Bhavesh ; Koul, Neeraj ; Honavar, Vasant. / Identifying and eliminating inconsistencies in mappings across hierarchical ontologies. On the Move to Meaningful Internet Systems, OTM 2010 - Confederated International Conferences: CoopIS, IS, DOA and ODBASE, Proceedings. PART 2. ed. 2010. pp. 999-1008 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{91612ad0f2834348a2c1867e9436c9ee,
title = "Identifying and eliminating inconsistencies in mappings across hierarchical ontologies",
abstract = "Many applications require the establishment of mappings between ontologies. Such mappings are established by domain experts or automated tools. Errors in mappings can introduce inconsistencies in the resulting combined ontology. We consider the problem of identifying the largest consistent subset of mappings in hierarchical ontologies. We consider mappings that assert that a concept in one ontology is a subconcept, superconcept, or equivalent concept of a concept in another ontology and show that even in this simple setting, the task of identifying the largest consistent subset is NP-hard. We explore several polynomial time algorithms for finding suboptimal solutions including a heuristic algorithm to this problem. We experimentally compare the algorithms using several synthetic as well as real-world ontologies and mappings.",
author = "Bhavesh Sanghvi and Neeraj Koul and Vasant Honavar",
year = "2010",
month = "12",
day = "16",
doi = "10.1007/978-3-642-16949-6_24",
language = "English (US)",
isbn = "3642169481",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "999--1008",
booktitle = "On the Move to Meaningful Internet Systems, OTM 2010 - Confederated International Conferences",
edition = "PART 2",

}

Sanghvi, B, Koul, N & Honavar, V 2010, Identifying and eliminating inconsistencies in mappings across hierarchical ontologies. in On the Move to Meaningful Internet Systems, OTM 2010 - Confederated International Conferences: CoopIS, IS, DOA and ODBASE, Proceedings. PART 2 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 6427 LNCS, pp. 999-1008, 9th Confederated International Conferences on On the Move to Meaningful Internet Systems, OTM 2010: CoopIS 2010, IS 2010, DOA 2010 and ODBASE 2010, Crete, Greece, 1/25/10. https://doi.org/10.1007/978-3-642-16949-6_24

Identifying and eliminating inconsistencies in mappings across hierarchical ontologies. / Sanghvi, Bhavesh; Koul, Neeraj; Honavar, Vasant.

On the Move to Meaningful Internet Systems, OTM 2010 - Confederated International Conferences: CoopIS, IS, DOA and ODBASE, Proceedings. PART 2. ed. 2010. p. 999-1008 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6427 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Identifying and eliminating inconsistencies in mappings across hierarchical ontologies

AU - Sanghvi, Bhavesh

AU - Koul, Neeraj

AU - Honavar, Vasant

PY - 2010/12/16

Y1 - 2010/12/16

N2 - Many applications require the establishment of mappings between ontologies. Such mappings are established by domain experts or automated tools. Errors in mappings can introduce inconsistencies in the resulting combined ontology. We consider the problem of identifying the largest consistent subset of mappings in hierarchical ontologies. We consider mappings that assert that a concept in one ontology is a subconcept, superconcept, or equivalent concept of a concept in another ontology and show that even in this simple setting, the task of identifying the largest consistent subset is NP-hard. We explore several polynomial time algorithms for finding suboptimal solutions including a heuristic algorithm to this problem. We experimentally compare the algorithms using several synthetic as well as real-world ontologies and mappings.

AB - Many applications require the establishment of mappings between ontologies. Such mappings are established by domain experts or automated tools. Errors in mappings can introduce inconsistencies in the resulting combined ontology. We consider the problem of identifying the largest consistent subset of mappings in hierarchical ontologies. We consider mappings that assert that a concept in one ontology is a subconcept, superconcept, or equivalent concept of a concept in another ontology and show that even in this simple setting, the task of identifying the largest consistent subset is NP-hard. We explore several polynomial time algorithms for finding suboptimal solutions including a heuristic algorithm to this problem. We experimentally compare the algorithms using several synthetic as well as real-world ontologies and mappings.

UR - http://www.scopus.com/inward/record.url?scp=78650002262&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78650002262&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-16949-6_24

DO - 10.1007/978-3-642-16949-6_24

M3 - Conference contribution

AN - SCOPUS:78650002262

SN - 3642169481

SN - 9783642169489

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 999

EP - 1008

BT - On the Move to Meaningful Internet Systems, OTM 2010 - Confederated International Conferences

ER -

Sanghvi B, Koul N, Honavar V. Identifying and eliminating inconsistencies in mappings across hierarchical ontologies. In On the Move to Meaningful Internet Systems, OTM 2010 - Confederated International Conferences: CoopIS, IS, DOA and ODBASE, Proceedings. PART 2 ed. 2010. p. 999-1008. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-642-16949-6_24