Evaluating class assignment semantic redundancy on linked datasets
Material type:
ArticleDescription: 1 archivo (1,9 MB)Subject(s): Summary: In this work we address the concept of semantic redundancy in linked datasets considering class assignment assertions. We discuss how redundancy can be evaluated as well as the relationship between redundancy and three class hierarchy aspects: the number of instances a class has, number of class descendants and class depth. Finally, we performed an evaluation on the DBpedia dataset using SPARQL queries for data redundancy checks.
| Item type | Home library | Collection | Call number | URL | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|
Capítulo de libro
|
Biblioteca de la Facultad de Informática | Biblioteca digital | A0892 (Browse shelf(Opens below)) | Link to resource | No corresponde |
Browsing Biblioteca de la Facultad de Informática shelves, Collection: Biblioteca digital Close shelf browser (Hides shelf browser)
Formato de archivo PDF. -- Este documento es producción intelectual de la Facultad de Informática - UNLP (Colección BIPA/Biblioteca)
In this work we address the concept of semantic redundancy in linked datasets considering class assignment assertions. We discuss how redundancy can be evaluated as well as the relationship between redundancy and three class hierarchy aspects: the number of instances a class has, number of class descendants and class depth. Finally, we performed an evaluation on the DBpedia dataset using SPARQL queries for data redundancy checks.
Annual International Symposium on Information Management and Big Data (3er : 2016 : Cuzco, Perú)