Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Ontology Integration Using Mappings: Towards Getting the Right Logical Consequences
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Supporting manual mapping revision using logical reasoning
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Completing description logic knowledge bases using formal concept analysis
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Non-standard reasoning services for the debugging of description logic terminologies
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Reasoning-supported interactive revision of knowledge bases
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Web Semantics: Science, Services and Agents on the World Wide Web
Hi-index | 0.00 |
When ontological knowledge is acquired automatically, quality control is essential. We consider the tightest possible approach - an exhaustive manual inspection of the acquired data. By using automated reasoning, we partially automate the process: after each expert decision, axioms that are entailed by the already approved statements are automatically approved, whereas axioms that would lead to an inconsistency are declined. Adequate axiom ranking strategies are essential in this setting to minimize the amount of expert decisions. In this paper, we present a generalization of the previously proposed ranking techniques which works well for arbitrary validity ratios - the proportion of valid statements within a dataset - whereas the previously described ranking functions were either tailored towards validity ratios of exactly 100% and 0% or were optimizing the worst case. The validity ratio - generally not known a priori - is continuously estimated over the course of the inspection process. We further employ partitioning techniques to significantly reduce the computational effort. We provide an implementation supporting all these optimizations as well as featuring a user front-end for successive axiom evaluation, thereby making our proposed strategy applicable to practical scenarios. This is witnessed by our evaluation showing that the novel parameterized ranking function almost achieves the maximum possible automation and that the computation time needed for each reasoning-based, automatic decision is reduced to less than one second on average for our test dataset of over 25,000 statements.