Using the Dempster-Shafer theory of evidence to resolve ABox inconsistencies
This event took place on Wednesday 07 November 2007 at 11:30
Andriy Nikolov Computing Research Centre, The Open University, UK
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.
This event took place on Wednesday 07 November 2007 at 11:30
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.
