Reasoning by analogy in the generation of domain acceptable ontology refinements

Moss, L. , Sleeman, D. and Sim, M. (2010) Reasoning by analogy in the generation of domain acceptable ontology refinements. Lecture Notes in Computer Science, 6317, pp. 534-543. (doi: 10.1007/978-3-642-16438-5_43)

Abstract

Refinements generated for a knowledge base often involve the learning of new knowledge to be added to or replace existing parts of a knowledge base. However, the justifiability of the refinement in the context of the domain (domain acceptability) is often overlooked. The work reported in this paper describes an approach to the generation of domain acceptable refinements for incomplete and incorrect ontology individuals through reasoning by analogy using existing domain knowledge. To illustrate this approach, individuals for refinement are identified during the application of a knowledge-based system, EIRA; when EIRA fails in its task, areas of its domain ontology are identified as requiring refinement. Refinements are subsequently generated by identifying and reasoning with similar individuals from the domain ontology. To evaluate this approach EIRA has been applied to the Intensive Care Unit (ICU) domain. An evaluation (by a domain expert) of the refinements generated by EIRA has indicated that this approach successfully produces domain acceptable refinements.

• Item Type: Articles
• Additional Information: The original publication is available at www.springerlink.com
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Sim, Malcolm and Moss, Dr Laura and Sleeman, Prof Derek
• Authors: Moss, L., Sleeman, D., and Sim, M.
• Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
• College/School: College of Medical Veterinary and Life Sciences > School of Medicine, Dentistry & Nursing
• Journal Name: Lecture Notes in Computer Science
• Publisher: Springer
• ISSN: 0302-9743
• Copyright Holders: Copyright © 2010 Springer
• First Published: First published in Lecture Notes in Computer Science 6317:534-543
• Publisher Policy: Reproduced in accordance with the copyright policy of the publisher