Matrix rank-based ontology matching: an extension of string equality matching
by N. Madurai Meenachi; M. Sai Baba
International Journal of Nuclear Knowledge Management (IJNKM), Vol. 7, No. 1, 2017

Abstract: In this paper, string-based algorithm and the analogy of the total number of deviations that exist between two matrices are utilised for ontology matching. The type of matching and the distance between them are derived from the rank of the matrix. This process is useful for an agent program to extract the knowledge from the application domain and to evaluate the result of matching to decide whether to include or exclude the ontology. As a case study to demonstrate the developed algorithm, the Fast Breeder Test Reactor (FBTR) is taken for analysis by representing its components like the steam generator system and the control rod drive mechanism in formats like Resource Description Framework (RDF) and Web Ontology Language (OWL).

Online publication date: Sat, 13-May-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Nuclear Knowledge Management (IJNKM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com