![]() |
|
![]() |
|
| AKTive PSI |
![]() |
AKTive PSI
The summer interns converted the data from those databases to RDF with respect to a set of given ontologies. Some data integration and ontology mapping was also performed. The work completed provides graph querying facility using JUNG. Graph queries (such as Betweenness, Shortest Path, Centrality, etc) are difficult to handle using current Semantic Web libraries such as Jena, Protege OWL API, etc. Querying ontologies with JUNG could help sorting out this problem. The above service is currently being used as part of a research work on ontology ranking. The ranking approach is based on the idea that the graph structure of an ontology may help estimate its quality with respect to representing certain classes. This work relies heavily on graph-queries, which are hard to code in RDQL and SPARQL. |