A Review on Scalability Issues Of Ontology’s Instance Matching
DOI:
https://doi.org/10.26438/ijcse/v7i1.606609Keywords:
Ontology, Instance Matching, Ontology population, Linked Data, Knowledge bases, RichnessAbstract
Immediately Ontology Matching is a challenge wished in diverse packages, for example for comparison or merging functions. Many algorithms fix the matching hassle may be determined, but most of them do no longer bear in mind instances at all. Mappings are determined by means of calculating the string-similarity of labels, by way of recognizing linguistic word members of the family (synonyms, subsumptions and so on or via analyzing the content similarity. . It relies heavily on measuring the similarity between the devices of the listed times or occurrences. Since heterogeneous sources of large cases ontology develop systematically from day to day. Scalability has come out as preliminary studies on ontology problems eg matching of semantic context bases. With the expansion of semantics’ web technologies and the guide of large RDF groups and interrelated statistics and ontologies that create the cloud of linked data. It is essential to expand the tailored Instance Matching strategies that put it characterized by an unprecedented variety of resources across Which hit on matches, a high level of heterogeneity each. The schema and the example, and the rich semantics that accompany schemas defined in the sentences of expressive languages Such as OWL, RDFS.
References
[1] Antoine Isaac Lourens , van der Meij, Stefan Schlobach, Shenghui Wang, “An Empirical Study of Instance-Based Ontology Matching”, International Semantic Web Conference pp253-266,2007.
[2] Katrin and Tim, “Instance-Based Ontology Matching Using Different Kinds of Formalisms” , World Academy of Science, Engineering and Technology, pp163-171,2009.
[3] Rudra, Hanif and Masaki , “Resolving Scalability Issue to Ontology Instance Matching in Semantic Web”,15th International Conference on Computer and Information Technology (ICCIT)., pp 396-404,2012.
[4] S. Castano , “On the Ontology Instance Matching Problem”. ,19th International Workshop on Database and Expert Systems Applications, pp 180-185,2008.
[5] Anhoi, Pedro, Alon, “Reconciling Schemas of Disparate Data Sources: A Machine-Learning Approach.” 2001
[6] A. Ferrara, Nikolov , Noessner, “Evaluation of Instance Matching Tools”. Journal Of Web Semantics, Pages 49-60,Volume 21,2003.
[7] Katrin Zaiß and Tim Schl¨uter, “Instance-Based Ontology Matching Using Different Kinds of Formalisms”. World Academy of Science, pp 164-172, 2009.
[8] A.Ferrara, Montanelli, “Benchmarking Matching Applications on the Semantic Web. The Semanic Web: Research and Applications”, pp 108-122, 2011
[9] Aono, Seddiqui, “Ontology Instance Matching by Considering Semantic Link Cloud.” ACE`10 Proceedings of the 9th WSEAS international conference on Applications of computer engineering, pp 22-27, 2010.
[10] Katrin Simone Zaib, “Instance-Based Ontology Matching and the Evaluation of Matching Systems.” Ph.D. thesis, Heinrich Heine Universität Düsseldorf, 2010.
[11] R. Gruber, “A Translation Approach to Portable Ontology Specifications. Journal Knowledge Acquisition”, Volume 5 Issue 2, pp 199 – 220, 1993 .
[12] Sameer dass, “Comparitive Analysis of Various Type of Quality Measuring Techinque of Ontologies. Iaetsd Journal For Advanced Research In Applied Sciences “,Volume 4, Issue 6, pp 28- 34, 2017.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
