LOD:KCAP analysis/PathDescription
From STLab
| Line 3: | Line 3: | ||
Hence, we define a path as composed by a number of elements equal to its length. A path has (i) a length (min 2), given by the number of properties that compose it, (ii) a number of occurrences, which is the number of its instances in the analysed dataset. | Hence, we define a path as composed by a number of elements equal to its length. A path has (i) a length (min 2), given by the number of properties that compose it, (ii) a number of occurrences, which is the number of its instances in the analysed dataset. | ||
| - | The ontology to use for describing the dataset summarized in this table can be downloaded at http://ontologydesignpatterns.org/ont/lod-analysis.owl | + | The ontology to use for describing the dataset summarized in this table can be downloaded at http://ontologydesignpatterns.org/ont/lod-analysis-path.owl |
In order to retrieve paths of a certain length we can use sparql queries. For example, for retrieving all paths of length 3, the query is the following: | In order to retrieve paths of a certain length we can use sparql queries. For example, for retrieving all paths of length 3, the query is the following: | ||
Revision as of 19:37, 22 January 2011
The table below indicates how to draw a table for describing paths to the aim of analyzing LOD patterns. A path is described through an ordered list of properties, which are used in the triple sequences that instantiate the path. Each property is associated to a position in the path, a subject type, and an object type. Hence, we define a path as composed by a number of elements equal to its length. A path has (i) a length (min 2), given by the number of properties that compose it, (ii) a number of occurrences, which is the number of its instances in the analysed dataset.
The ontology to use for describing the dataset summarized in this table can be downloaded at http://ontologydesignpatterns.org/ont/lod-analysis-path.owl
In order to retrieve paths of a certain length we can use sparql queries. For example, for retrieving all paths of length 3, the query is the following:
SELECT DISTINCT ?type1 ?p1 ?type2 ?p2 ?type3 ?p3 ?type4
WHERE { ?x ?p1 ?y . ?y ?p2 ?z . ?z ?p3 ?w .
?x a ?type1 . ?y a ?type2 . ?z a ?type3 . ?w a ?type4 .}
| Name of the column | Explanation | Associated semantic entity |
|---|---|---|
| Length | The length of the path, which is the number of properties composing the path. | |
| Properties | The ordered list of properties composing the path. For example, a path of length 3 could be (linkedmdb:cinematographer, linkedmdb:performance, linkedmdb:film_character) | |
| Types | The actual types use in the triples (in the respective order) as they are observed in the path occurrences, in the respective order. E.g. (linkedmdb:film, foaf:Person, linkedmdb:film, linkedmdb:performance, linkedmdb:film_character) | |
| Number of path occurrences | The number of instances of that path retrieved in the analysed dataset. | |
| Knowledge Pattern | One or more existing knowledge patterns that can be matched to some extent to the observed path e.g. because they include it. | |
| Comments | Useful remarks to the interpretation of the analysis. |
