Name
Abstract | ||
|---|---|---|
We focus on the problem of predicting missing assertions in Web ontologies. We start from the assumption that individual resources that are similar in some aspects are more likely to be linked by specific relations: this phenomenon is also referred to as homophily and emerges in a variety of relational domains. In this article, we propose a method for (1) identifying which relations in the ontology are more likely to link similar individuals and (2) efficiently propagating knowledge across chains of similar individuals. By enforcing sparsity in the model parameters, the proposed method is able to select only the most relevant relations for a given prediction task. Our experimental evaluation demonstrates the effectiveness of the proposed method in comparison to state-of-the-art methods from the literature. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-13704-9_24 | TWEB |
Field | DocType | Volume |
Transduction (machine learning),Ontology (information science),Data mining,Incomplete knowledge,Inference,Computer science,Knowledge management,IDEF5,Web modeling,Social Semantic Web,AND gate | Conference | 12 |
Issue | ISSN | Citations |
1 | 1559-1131 | 1 |
PageRank | References | Authors |
0.36 | 46 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pasquale Minervini | 1 | 119 | 16.34 |
| Claudia D'Amato | 2 | 733 | 57.03 |
| Nicola Fanizzi | 3 | 1124 | 90.54 |
| Floriana Esposito | 4 | 2434 | 277.96 |