{"id":1402,"date":"2013-06-28T22:49:37","date_gmt":"2013-06-28T22:49:37","guid":{"rendered":"https:\/\/notebooks.dataone.org\/?p=1402"},"modified":"2013-06-28T22:49:37","modified_gmt":"2013-06-28T22:49:37","slug":"working-with-aroma-progress-with-falcon-ao","status":"publish","type":"post","link":"https:\/\/notebooks.dataone.org\/ontology-map\/working-with-aroma-progress-with-falcon-ao\/","title":{"rendered":"Working with AROMA & Progress with Falcon-AO"},"content":{"rendered":"

Having concluded last week that apart from Falcon-AO, it is imperative to explore other approaches\/algorithms, I started working on AROMA (Association Rule Ontology Matching Approach). It is a hybrid, extensional and asymmetric matching approach which allows to match not only equivalence relations but also subsumption relations between
\nentities, i.e. classes and properties, issued from two OWL ontologies. AROMA relies on the following assumption: An entity A will be more specific than or equivalent to an entity B if the vocabulary (i.e. terms and also data) used to describe A, its descendants, and its instances tends to be included in that of B.<\/p>\n

It is divided into three successive main stages:-<\/p>\n

    \n
  1. pre processing stage<\/span>: Here the data is prepared by constructing a set of relevant terms and\/or datavalues for each class and property.<\/li>\n
  2. second stage<\/span>: Here the association rules between entities are discovered. The association rule a -> b, is a subsumption relation from the antecedent entity toward the consequent one. (refer to the assumption in the first para).\u00a0 For example, the binary rule car \u2192 vehicle means: \u201dThe concept car is more specific than the concept vehicle\u201d.<\/li>\n
  3. post processing stage<\/span>: The alignments produced in the previous stage are enhanced by… deduction of equivalence relations, suppression of cycles in the alignment graph, suppression of redundant correspondences & selection of the best correspondence for each entity. This stage uses equality-based and string similarity-based matchers.<\/li>\n<\/ol>\n

    AROMA has participated\u00a0in various iterations of oaei for several years on many tracks such as benchmark, anatomy and conference with considerably good results.<\/p>\n

    I applied this algorithm onto some OWL ontologies downloaded from the bioportal & the esip semantic web portal. The resulting alignments produced were interesting. The algorithm necessitates parsing of two ontologies at a time and produces a file in .rdf format which contains alignment relations between the preprocessed terms(set made in\u00a0 the first stage). Ontologies used are: sweet, oboe-sbc, swo, biodiversity. Although the alignments produced had the expected relations, but were mostly rid with warnings and errors, some times inexplicable. Only the biodiversity ontology seems to work fine with this algorithm, with the remaining producing errors\/exceptions during the preprocessing stage like ava.lang.NullPointerException, NotFoundException.<\/p>\n

    Possible reasons could be that the tested ontologies were broken or there were problems with Jena (com.hp.hpl.jena.util.FileManager) or maybe AROMA is not good enough to produce correct alignments for these ontologies(but this seems a bit far-fetched).<\/p>\n

    So, continuing with this line of thought I intend to explore the said algorithm more, possibly testing it on few other ontologies even if not related to the earth & environment domain to check the consistency of the algorithm. Since it accepts only OWL format is input the no. of ontologies become limited. Also I would test the algo on parts of the sweet ontology – thoughtful suggestion by the mentor.<\/p>\n

    Apart from this, I also played around with Falcon-AO and removed some errors from the source code. Falcon does boast of a nice GUI and I hope to make it work pretty soon, possibly.<\/p>\n","protected":false},"excerpt":{"rendered":"

    Having concluded last week that apart from Falcon-AO, it is imperative to explore other approaches\/algorithms, I started working on AROMA (Association Rule Ontology Matching Approach). It is a hybrid, extensional and asymmetric matching approach which allows to match not only equivalence relations but also subsumption relations between entities, i.e. classes Continue reading Working with AROMA & Progress with Falcon-AO<\/span>→<\/span><\/a><\/p>\n","protected":false},"author":37,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[14],"tags":[],"_links":{"self":[{"href":"https:\/\/notebooks.dataone.org\/wp-json\/wp\/v2\/posts\/1402"}],"collection":[{"href":"https:\/\/notebooks.dataone.org\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/notebooks.dataone.org\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/notebooks.dataone.org\/wp-json\/wp\/v2\/users\/37"}],"replies":[{"embeddable":true,"href":"https:\/\/notebooks.dataone.org\/wp-json\/wp\/v2\/comments?post=1402"}],"version-history":[{"count":7,"href":"https:\/\/notebooks.dataone.org\/wp-json\/wp\/v2\/posts\/1402\/revisions"}],"predecessor-version":[{"id":1412,"href":"https:\/\/notebooks.dataone.org\/wp-json\/wp\/v2\/posts\/1402\/revisions\/1412"}],"wp:attachment":[{"href":"https:\/\/notebooks.dataone.org\/wp-json\/wp\/v2\/media?parent=1402"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/notebooks.dataone.org\/wp-json\/wp\/v2\/categories?post=1402"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/notebooks.dataone.org\/wp-json\/wp\/v2\/tags?post=1402"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}