Granular best match algorithm for context-aware computing systems

doi:10.1016/j.jss.2007.03.006

Return

Granular best match algorithm for context-aware computing systems

2007-12-01

PRE

A. Baki Kocaballı *

Altan Koçyiğit

DOI：10.1016/j.jss.2007.03.006

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2007 Elsevier Inc. All rights reserved.

Keywords:

pervasive computing

context-awareness

context matching

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.