A framework for improving the performance of ontology matching techniques in semantic web

العناوين الأخرى

نظام لتحسين أداء تقنيات مطابقة الأنطولوجيا في الويب الدلالي

مقدم أطروحة جامعية

Shafaamiri, Kamil H.

مشرف أطروحة جامعية

al-Atum, Jalal Umar

أعضاء اللجنة

Ujan, Arafat
Salamah, Walid Khalid
Abu al-Suud, Salih Mustafa

الجامعة

جامعة الأميرة سمية للتكنولوجيا

الكلية

كلية الملك الحسين لعلوم الحوسبة

القسم الأكاديمي

قسم علم الحاسوب

دولة الجامعة

الأردن

الدرجة العلمية

ماجستير

تاريخ الدرجة العلمية

2011

الملخص الإنجليزي

The semantic web is an extension of the World Wide Web (WWW) with new technologies that enable computers to process the data on the web and to extract knowledge from these data.

The development of the semantic web is based on ontology.

Ontology provides a knowledge representation in a specific 'domain.

Sometimes we can find different ontologies that describe the same domain, this leads to a problem called heterogeneity problem between ontologies.

This thesis is about ontology matching process that solves the heterogeneity problems between different ontologies.

Ontology matching is the process of finding correspondences between semantically related entities of different ontologies.

Some ontologies may contain thousands of entities which make the ontology matching process very complex in terms of space and time requirements, because there will be a very large search space to find correspondences between ontologies.

We have designed a framework that reduces the search space by removing entities (classes, properties) that have less probability of being matched.

In order to achieve this goal we have introduced a matching strategy that uses multi matching techniques such as string, structure, and linguistic matching techniques.

This strategy is based on some important features of ontologies, such as Resource Description Framework (RDF) statements and class hierarchies.

The results obtained from this new proposal matching framework have indicated that the proposed matching framework produces good quality matching results in a low time requirement and a low search space in comparisons with other matching frameworks.

It saves from (43% - 53%) of the search space, and saves on the time requirement from (38% - 45%).

التخصصات الرئيسية

تكنولوجيا المعلومات وعلم الحاسوب

الموضوعات

• الفلسفة
• علم الوجود

عدد الصفحات

75

قائمة المحتويات

• APA
• MLA
• AMA

لغة النص

الإنجليزية

نوع البيانات

رسائل جامعية

رقم السجل

BIM-307146