I am searching for some algorithm to find in-direct relations among RDF concepts e.g. relation between a 'Book' and publication date. There is no direct property that can relate these two and we have a multi-link path to find this relation i.e. 'Book' got a publication event, A publication even got property event time, Event time got a Calendar year that has a label. In short we will come up with following statements (for SPARQL)
{?book a bibo:Book}
{?event a blt:PublicationEvent}
{?book blt:publication ?event}
{?event event:time ?time}
{?time rdfs:label ?year}
Is there any implementation already available (like Jena API) that helps to find in-direct paths for connecting concepts?
Hi,
Maybe you could check the experimental features of Jena for find shortest path [1]. In the link you could find it in the bottom of the page.
Hope this helps!
[1] https://jena.apache.org/documentation/ontology/
Hi , Fatima !
I used the Jena Jena Ontology API to develop a tool that uses ontologies to build a knowledge base , I think in your case you can also make use of jena API the same way.
I published an article about this subject.
" Ontology Supported Information Extraction for Document of Evidence - Based Nursing Domain"
Hi Flavio,
I am using Jena API to parse ontologies and RDF and it gives me classes, direct data type and object properties. But I am not able to get in-direct paths as I mentioned above. I saw the link introduced by Fajar and tried that and I found that it only works for the concept under one namespace. I am writing my own parser now. Hope that will do the job for me.
Hi Fatima,
Please notify me if you're succeeded in the creation of such implementation. I will be interested to use it later on.
Thanks!
May be you can use SPARQL to find indirect paths from RDF graphs. (At here you can find a very good tutorial http://www.cambridgesemantics.com/semantic-university/sparql-by-example).
I think you can use property paths looking a not explicit path bewteen RDF nodes, this is the specification of the W3C for SPARQL 1.1 property paths: http://www.w3.org/TR/sparql11-query/#propertypaths
If you want to find the shortest path between two nodes, you can use this work http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=7004371 extends SPARQL with graph operations.
Thanks Federico. Actually I was looking for a solution to find all possible in-direct paths between two RDF concepts. I found that ...
Finally, I came to a conclusion to write my own parser. While writing the parser, I realised that all domains do not provide reasoning with their ontology that makes the task more difficult. That gave me an idea to parse RDF datasets instead ontology parsing. Anyway I have written a very basic parser that parses RDF datasets (currently supports RDF/XML only) to find indirect paths. I will keep updating the parser up-to the requirements. The parser is found at the attached link if anyone is interested
https://github.com/Semantira/rdf_indirect_property_paths
- Badges
- Science topic
- Similar topics
- Mathematics