{"id":2741,"date":"2014-07-30T14:57:06","date_gmt":"2014-07-30T18:57:06","guid":{"rendered":"http:\/\/fgiasson.com\/blog\/?p=2741"},"modified":"2014-07-30T14:57:06","modified_gmt":"2014-07-30T18:57:06","slug":"umbel-new-shortest-path-web-service-tag-web-documents","status":"publish","type":"post","link":"https:\/\/fgiasson.com\/blog\/index.php\/2014\/07\/30\/umbel-new-shortest-path-web-service-tag-web-documents\/","title":{"rendered":"UMBEL: New Shortest Path Web Service & Tag Web Documents"},"content":{"rendered":"\n\n\n
We just released a new UMBEL<\/a> ontology graph analysis web service endpoint: the Shortest Path web service endpoint<\/a>.<\/td>\n\"umbel_ws\"<\/a><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

The Shortest Path<\/code> Web service is used to get the shortest path between two UMBEL reference concepts by following the path of a transitive property. The concepts that belong to that path will be returned by the server.<\/p>\n

This web service is similar to the degree<\/a><\/code> web service endpoint but the actual path is shown. This web service is (marginally more useful) than degree<\/a><\/code>. So if you don’t need to know the actual concepts that participate in the shortest path between two concepts, then you should be using the degree<\/a><\/code> web service endpoint instead.<\/p>\n

The graph created by the UMBEL reference concepts ontology is a mostly an directed acyclic graph (DAG). This means that a given pair of concepts is not necessarily linked via all the properties. In these cases, the shortest path returns an error message rather than the path concepts.<\/p>\n

Intended Users<\/h3>\n

This new web service endpoint is intended for users that want to perform graph\/network analysis tasks on the UMBEL web service endpoint.<\/p>\n

The Web Service Endpoint<\/span><\/h3>\n

The web service endpoint<\/a> is freely available. It can return its resultset in JSON or in EDN<\/a> (Extensible Data Notation).<\/p>\n

This endpoint will return a vector (so the order of the results is important) of concepts that participate into the shortest path. For each concept, its URI and preferred label are returned.<\/p>\n

The Online Tool<\/span><\/h3>\n

We also provide an online shortest path tool<\/a> that people can use to experience interacting with the web service.<\/p>\n

The user first needs to select the two concepts for which he wants to find the shortest path between the two. Then he has to select the transitive property he want to use to find the path.<\/p>\n

Once the user clicks the Get Shortest Path<\/code> button, he will get list of concepts, and the order, that compose the path.<\/p>\n

If no path exists between the two concepts for the selected property, an error message is displayed to the user.<\/p>\n


\n\"shortest-path-ui\"<\/a><\/center><\/p>\n

Tagging Web Documents with the UMBEL Taggers<\/h3>\n

Another improvement included with this release is the enhancement of the UMBEL taggers1<\/a><\/sup>2<\/a><\/sup>. It is now possible to tag any document accessible on the Web. The only thing you have to do is to provide a URL where the tagger will find the document to download and tag.<\/p>\n

The user interface<\/a> for the taggers also was modified to expose this new functionality. You now have the choice to give a text or a URL as input to the endpoints:<\/p>\n


\n\"new-tagging-ui\"<\/a><\/center><\/p>\n
\n
<\/div>\n
    \n
  1. Concept Tagger (plain)<\/a> ↩<\/a><\/span><\/li>\n
  2. Concept Tagger (noun)<\/a> ↩<\/a><\/span><\/li>\n<\/ol>\n<\/div>\n","protected":false},"excerpt":{"rendered":"

    We just released a new UMBEL ontology graph analysis web service endpoint: the Shortest Path web service endpoint. The Shortest Path Web service is used to get the shortest path between two UMBEL reference concepts by following the path of a transitive property. The concepts that belong to that path will be returned by the […]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_memberships_contains_paid_content":false,"footnotes":""},"categories":[84,153,148],"tags":[265,160,168,238],"class_list":["post-2741","post","type-post","status-publish","format-standard","hentry","category-semantic-web","category-structured-dynamics","category-umbel","tag-graph","tag-ontology","tag-umbel-2","tag-webservices"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/fgiasson.com\/blog\/index.php\/wp-json\/wp\/v2\/posts\/2741","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/fgiasson.com\/blog\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/fgiasson.com\/blog\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/fgiasson.com\/blog\/index.php\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/fgiasson.com\/blog\/index.php\/wp-json\/wp\/v2\/comments?post=2741"}],"version-history":[{"count":9,"href":"https:\/\/fgiasson.com\/blog\/index.php\/wp-json\/wp\/v2\/posts\/2741\/revisions"}],"predecessor-version":[{"id":2752,"href":"https:\/\/fgiasson.com\/blog\/index.php\/wp-json\/wp\/v2\/posts\/2741\/revisions\/2752"}],"wp:attachment":[{"href":"https:\/\/fgiasson.com\/blog\/index.php\/wp-json\/wp\/v2\/media?parent=2741"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/fgiasson.com\/blog\/index.php\/wp-json\/wp\/v2\/categories?post=2741"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/fgiasson.com\/blog\/index.php\/wp-json\/wp\/v2\/tags?post=2741"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}