Using the Dempster-Shafer theory of evidence to resolve ABox inconsistencies Andriy Nikolov
This event took place on 7th November 2007 at 11:30am (11:30 GMT)
Knowledge Media Institute, Berrill Building, The Open University, Milton Keynes, United Kingdom, MK7 6AA
Automated ontology population using information extraction algorithms can produce inconsistent knowledge bases. Confidence values assigned by the extraction algorithms may serve as evidence helping to repair produced inconsistencies. Dempster-Shafer theory of evidence is a formalism, which allows appropriate interpretation of extractors’
confidence values. The talk presents an algorithm for translating the subontologies containing conflicts into belief propagation networks and repairing conflicts based on Dempster-Shafer plausibility.
Automated ontology population using information extraction algorithms can produce inconsistent knowledge bases. Confidence values assigned by the extraction algorithms may serve as evidence helping to repair produced inconsistencies. Dempster-Shafer theory of evidence is a formalism, which allows appropriate interpretation of extractors’