On the Implementation of an Algebra of Lightweight Ontologies

Magalhães, Rômulo C.; Casanova, Marco A.; Nunes, Bernardo Pereira; Lopes, Giseli Rabello

doi:10.1145/3105831.3105856

Cited by 2 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Those nodes will be kept safe for future use. We used the Ontology Manager Tab [28] and the SubInterNM (defined in [40]) modified with the projection operation.…”

Section: ) Extracting the Relevant Nodesmentioning

confidence: 99%

Matching Network of Ontologies: A Random Walk and Frequent Itemsets Approach

Santos

Mello

2022

IEEE Access

View full text Add to dashboard Cite

A System of Systems (SoS) is a complex set of IS (Information Systems) created by the aggregation and interconnection of ISs. SoS brings unexpected behavior and functionality during its construction to the benefit of its users and the SoS itself. The integration of SoSs is a matter of time. However, as SoSs can behave as an organization, it may be inappropriate to try to integrate individual IS members separately. On the other hand, manually integrating the SoS as a whole can be unfeasible due to its complexity. If an SoS has ontologies modeling the knowledge, the integration of SoSs can be translated into a problem of a network of ontologies alignment. However, it creates another challenge: computing each possible pair of entities inside each network's ontology can have unfeasible execution time, even using the best matchers available. In this article, we propose to mine the data from the networks using random walks and frequent item sets algorithm and discover relevant nodes elected as candidate entities. Next, the networks are pruned by an algebraic method eliminating identical entities. The relevant nodes are reinserted in the network to avoid losing essential correspondences. After the pre-processing step, data is sent to two matchers to obtain metrics and compare the results with the pairwise brute force approach and previous work. We identified relevant nodes with recall up to 0.75. The results are promising since precision and recall are closer to the force brute, and execution time is shorter, even more, when the size of the networks and the number of ontologies to be compared increases. We validate our approach using ontologies created from the OAEI (Ontology Alignment Evaluation Initiative).INDEX TERMS System integration, system of systems, ontology matching, network of ontologies.

show abstract

“…Those nodes will be kept safe for future use. We used the Ontology Manager Tab [28] and the SubInterNM (defined in [40]) modified with the projection operation.…”

Section: ) Extracting the Relevant Nodesmentioning

confidence: 99%

Matching Network of Ontologies: A Random Walk and Frequent Itemsets Approach

Santos

Mello

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Other tools, such as OAPT [2], addressed the question of partitioning an ontology into modules to facilitate ontology reuse. The OntologyManagerTab [20] is a full implementation of the operations described in this chapter as a Protégé plug-in.…”

Section: Selected Related Workmentioning

confidence: 99%

Operations over Lightweight Ontologies and Their Implementation

Casanova

Magalhães

2020

Implicit and Explicit Semantics Integration in Proof-Based Developments of Discrete Systems

Self Cite

View full text Add to dashboard Cite

This chapter first defines a set of operations that create new ontologies, including their constraints, out of other ontologies. The projection, union, and deprecation operations help define new ontologies by reusing fragments of other ontologies, the intersection operation constructs the constraints that hold in two ontologies, and the difference operation returns the constraints that hold in one ontology, but not in the other. Then, the chapter discusses how to implement the operations for a class of ontologies, called lightweight ontologies. The key question is how to concretely construct the constraints of the resulting ontology, which is solved with the help of a structural proof procedure for lightweight ontologies. Lastly, it addresses the question of minimizing the set of constraints of a lightweight ontology.

show abstract

On the Implementation of an Algebra of Lightweight Ontologies

Cited by 2 publications

References 11 publications

Matching Network of Ontologies: A Random Walk and Frequent Itemsets Approach

Matching Network of Ontologies: A Random Walk and Frequent Itemsets Approach

Operations over Lightweight Ontologies and Their Implementation

Contact Info

Product

Resources

About