Return to search

Weighted Granular Best Matching Algorithm For Context-aware Computing Systems

Weighted granular best matching algorithm is proposed for the operation of context matching in context-aware computing systems. New algorithm deals with the subjective, fuzzy and multidimensional characteristics of contextual information by using weights and a granular structure for contextual information. The proposal is applied on a case: CAPRA &ndash / Context-Aware Personal Reminder Agent tool to show the applicability of the new context matching algorithm. The obtained outputs showed that proposed algorithm produces the results which are more sensitive to the user&rsquo / s intention, more adaptive to the characteristics of the contextual information and applicable to a current Context-aware system.

Identiferoai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12605825/index.pdf
Date01 January 2005
CreatorsKocaballi, Ahmet Baki
ContributorsKocyigit, Altan
PublisherMETU
Source SetsMiddle East Technical Univ.
LanguageEnglish
Detected LanguageEnglish
TypeM.S. Thesis
Formattext/pdf
RightsTo liberate the content for public access

Page generated in 0.0038 seconds