Name
Abstract | ||
|---|---|---|
Despite the benefits deriving from explicitly modeling concept disjointness to increase the quality of the ontologies, the number of disjointness axioms in vocabularies for the Web of Data is still limited, thus risking to leave important constraints underspecified. Automated methods for discovering these axioms may represent a powerful modeling tool for knowledge engineers. For the purpose, we propose a machine learning solution that combines (unsupervised) distance-based clustering and the divide-and-conquer strategy. The resulting terminological cluster trees can be used to detect candidate disjointness axioms from emerging concept descriptions. A comparative empirical evaluation on different types of ontologies shows the feasibility and the effectiveness of the proposed solution that may be regarded as complementary to the current methods which require supervision or consider atomic concepts only. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-58068-5_12 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Ontology (information science),Data mining,Information retrieval,Computer science,Axiom,Linked data,Semantic Web,Description logic,Knowledge base,Cluster analysis,Medoid | Conference | 10249 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
14 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giuseppe Rizzo | 1 | 349 | 37.75 |
| Claudia D'Amato | 2 | 733 | 57.03 |
| Nicola Fanizzi | 3 | 1124 | 90.54 |
| Floriana Esposito | 4 | 2434 | 277.96 |