short-paper

Online ontology shortest paths searcher

Author:

Ondřej ZamazalAuthors Info & Claims

SEMANTICS '15: Proceedings of the 11th International Conference on Semantic Systems

Pages 204 - 206

https://doi.org/10.1145/2814864.2814894

Published: 16 September 2015 Publication History

Get Access

Abstract

Entities within an ontology are connected via different paths. Connection of entities can be even considered within an ontology merged with its import closure constituting an ontology network. This demo paper presents a web-based tool for search of shortest path between entities in an ontology or an ontology network. Computing shortest paths is an important task for different graph based analysis and it can also support an user in his/her relationship exploration effort.

References

[1]

Apache Software Foundation. Apache Jena. July 2015. URL: https://jena.apache.org/.

Google Scholar

[2]

Doran P., Tamma, V., Palmisano I., Payne T. R., Iannone L. Evaluating ontology modules using an entropy inspired metric. In: Web Intelligence and Intelligent Agent Technology. pp. 918--922. IEEE. 2008.

Digital Library

Google Scholar

[3]

Heim P., Hellmann S., Lehmann J., Lohmann S., Stegemann T. RelFinder: Revealing relationships in RDF knowledge bases. Semantic Multimedia. Springer Berlin Heidelberg, 2009.

Digital Library

Google Scholar

[4]

Rada R., Mili H., Bicknell E., Blettner M.: Development and application of a metric on semantic nets. In: IEEE Transactions On Systems Man And Cybernetics. 1989. 19:17--30.

Google Scholar

[5]

Skiena S. The Algorithm Design Manual. Springer. 2008.

Digital Library

Google Scholar

[6]

Tartir, S., Arpinar, I. B., Moore, M., Sheth, A. P., Aleman-Meza, B.: OntoQA: Metric-based ontology quality analysis. In: Worksh. on Knowl. Acquisition from Distributed, Autonomous, Semantic. Heterogeneous Data and Knowl. Sources 2006.

Google Scholar

Index Terms

Online ontology shortest paths searcher

Recommendations

Improved algorithms for the k simple shortest paths and the replacement paths problems

Given a directed, non-negatively weighted graph G=(V,E) and s,t@?V, we consider two problems. In the k simple shortest paths problem, we want to find the k simple paths from s to t with the k smallest weights. In the replacement paths problem, we want ...
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths

We study the complexity of two inverse shortest paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph D = (V, A), the task is to find positive integer arc ...
Shortest Paths with Shortest Detours

This paper is concerned with a biobjective routing problem, called the shortest path with shortest detour problem, in which the length of a route is minimized as one criterion and, as second, the maximal length of a detour route if the chosen route is ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SEMANTICS '15: Proceedings of the 11th International Conference on Semantic Systems

September 2015

220 pages

ISBN:9781450334624

DOI:10.1145/2814864

Editors:
Sebastian Hellmann
AKSW/KILT, Universität Leipzig, Germany
,
Josiane Xavier Parreira
Siemens AG Austria, Austria
,
Axel Polleres
Vienna University of Economy and Business (WU), Austria

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 September 2015

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Short-paper

Funding Sources

Czech Science Foundation

Conference

SEMANTiCS '15

SEMANTiCS '15: 11th International Conference on Semantic Systems

September 16 - 17, 2015

Vienna, Austria

Acceptance Rates

SEMANTICS '15 Paper Acceptance Rate 22 of 97 submissions, 23%;

Overall Acceptance Rate 40 of 182 submissions, 22%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
57
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Nov 2024

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Improved algorithms for the k simple shortest paths and the replacement paths problems

Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths

Shortest Paths with Shortest Detours