Granular best match algorithm for context-aware computing systems

A. Baki Kocaballi*, Altan Koçyiğit

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


In order to be context-aware, a system or application should adapt its behaviour according to current context, acquired by various context provision mechanisms. After acquiring current context, this information should be matched against the previously defined context sets. In this paper, a granular best match algorithm dealing with the subjective, fuzzy, multi-granular and multi-dimensional characteristics of contextual information is introduced. The CAPRA - Context-Aware Personal Reminder Agent tool is used 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's intention, and more adaptive to the aforementioned characteristics of the contextual information than the traditional exact match method.

Original languageEnglish
Pages (from-to)2015-2024
Number of pages10
JournalJournal of Systems and Software
Issue number12
Publication statusPublished - Dec 2007
Externally publishedYes


  • pervasive computing
  • context-awareness
  • context matching

Cite this