An ontology and conceptual graph based best matching algorithm for context-aware applications

---

Tezin Türü: Yüksek Lisans

Tezin Yürütüldüğü Kurum: Orta Doğu Teknik Üniversitesi, Enformatik Enstitüsü, Bilişim Sistemleri Anabilim Dalı, Türkiye

Tezin Onay Tarihi: 2011

Öğrenci: REZA KOUSHAEİAN

Danışman: ALTAN KOÇYİĞİT

Özet:

Context-aware computing is based on using knowledge about the current context. Interpretation of current context to an understandable knowledge is carried out by reasoning over context and in some cases by matching the current context with the desired context. In this thesis we concentrated on context matching issue in context-aware computing domain. Context matching can be done in various ways like it is done in other matching processes. Our matching approach is best matching in order to generate granular similarity results and not to be limited to Boolean values. We decided to use Ontology as the encoded domain knowledge for our matching method. Context matching method is related to the method that we represent context. We selected conceptual graphs to represent the context. We proposed a generic algorithm for context matching based on the ontological information that benefit from the conceptual graph theory and its advantages.