International audienceWe address the problem of predicting a score for candidate axioms within the context of ontology learning. The prediction is based on a learning procedure based on support vector clustering originally developed for inferring the membership functions of fuzzy sets, and on a similarity measure for subsumption axioms based on semantic considerations and reminiscent of the Jaccard index. We show that the proposed method successfully learns the possibilistic score in a knowledge base consisting of pairs of candidate OWL axioms, meanwhile highlighting that a small subset of the considered axioms turns out harder to learn than the remainder
For expressive ontology languages such as OWL 2 DL, classification is a computationally expensive ta...
BACKGROUND: Semantic similarity searches in ontologies are an important component of many bioinforma...
We present an approach to mine cardinality restriction axioms from an existing knowledge graph, in o...
International audienceWe address the problem of predicting a score for candidate axioms within the c...
Within the context of ontology learning, we consider the problem of selecting candidate axioms throu...
International audienceWithin the context of ontology learning, we consider the problem of selecting ...
International audienceCandidate axiom scoring is the task of assessing the acceptability of a candid...
International audienceAutomatic knowledge base enrichment methods rely criti-cally on candidate axio...
Semantic similarity searches in ontologies are an important component of many bioinformatic algorith...
Abstract. We propose a novel approach for performance prediction of OWL reasoners. It selects suitab...
We propose a novel approach to performance prediction of OWL reasoners. The existing strategies take...
Abstract. A key issue in semantic reasoning is the computational com-plexity of inference tasks on e...
International audienceAxiom learning is an essential task in enhancing the quality of an ontology, a...
International audienceWe develop the theory of a possibilistic framework for OWL 2 axiom testing aga...
This work concerns non-parametric approaches for statistical learning applied to the standard knowle...
For expressive ontology languages such as OWL 2 DL, classification is a computationally expensive ta...
BACKGROUND: Semantic similarity searches in ontologies are an important component of many bioinforma...
We present an approach to mine cardinality restriction axioms from an existing knowledge graph, in o...
International audienceWe address the problem of predicting a score for candidate axioms within the c...
Within the context of ontology learning, we consider the problem of selecting candidate axioms throu...
International audienceWithin the context of ontology learning, we consider the problem of selecting ...
International audienceCandidate axiom scoring is the task of assessing the acceptability of a candid...
International audienceAutomatic knowledge base enrichment methods rely criti-cally on candidate axio...
Semantic similarity searches in ontologies are an important component of many bioinformatic algorith...
Abstract. We propose a novel approach for performance prediction of OWL reasoners. It selects suitab...
We propose a novel approach to performance prediction of OWL reasoners. The existing strategies take...
Abstract. A key issue in semantic reasoning is the computational com-plexity of inference tasks on e...
International audienceAxiom learning is an essential task in enhancing the quality of an ontology, a...
International audienceWe develop the theory of a possibilistic framework for OWL 2 axiom testing aga...
This work concerns non-parametric approaches for statistical learning applied to the standard knowle...
For expressive ontology languages such as OWL 2 DL, classification is a computationally expensive ta...
BACKGROUND: Semantic similarity searches in ontologies are an important component of many bioinforma...
We present an approach to mine cardinality restriction axioms from an existing knowledge graph, in o...