Granular best match algorithm for context-aware computing systems

A. Baki Kocaballi; Altan Koçyiǧit

doi:10.1109/PERSER.2006.1652218

Granular best match algorithm for context-aware computing systems

A. Baki Kocaballi^*, Altan Koçyiǧit

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

5 Citations (Scopus)

Abstract

In order to be context-aware, a system or application should adapt its behavior according to current context, changing over time. Current context is acquired by some context provision mechanisms like sensors or other applications. 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 language	English
Title of host publication	PERSER '06 Proceedings of the 2006 ACS/IEEE International Conference on Pervasive Services
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	143-149
Number of pages	7
Volume	2006
ISBN (Print)	1424402379, 9781424402373
DOIs	https://doi.org/10.1109/PERSER.2006.1652218
Publication status	Published - 1 Dec 2006
Externally published	Yes
Event	ICPS:2006 International Conference on Pervasive Services - Lyon, France Duration: 26 Jun 2006 → 29 Jun 2006

Conference

Conference	ICPS:2006 International Conference on Pervasive Services
Country	France
City	Lyon
Period	26/06/06 → 29/06/06

Keywords

Context matching
Context-aware computing
Context-awareness
Pervasive computing

Access to Document

10.1109/PERSER.2006.1652218

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Granular best match algorithm for context-aware computing systems'. Together they form a unique fingerprint.

Cite this

@inproceedings{35f0dc3a82d246d4829035ec442e3329,

title = "Granular best match algorithm for context-aware computing systems",

abstract = "In order to be context-aware, a system or application should adapt its behavior according to current context, changing over time. Current context is acquired by some context provision mechanisms like sensors or other applications. 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.",

keywords = "Context matching, Context-aware computing, Context-awareness, Pervasive computing",

author = "Kocaballi, {A. Baki} and Altan Ko{\c c}yiǧit",

year = "2006",

month = dec,

day = "1",

doi = "10.1109/PERSER.2006.1652218",

language = "English",

isbn = "1424402379",

volume = "2006",

pages = "143--149",

booktitle = "PERSER '06 Proceedings of the 2006 ACS/IEEE International Conference on Pervasive Services",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

note = "ICPS:2006 International Conference on Pervasive Services ; Conference date: 26-06-2006 Through 29-06-2006",

}

Kocaballi, AB & Koçyiǧit, A 2006, Granular best match algorithm for context-aware computing systems. in PERSER '06 Proceedings of the 2006 ACS/IEEE International Conference on Pervasive Services. vol. 2006, 1652218, Institute of Electrical and Electronics Engineers (IEEE), pp. 143-149, ICPS:2006 International Conference on Pervasive Services, Lyon, France, 26/06/06. https://doi.org/10.1109/PERSER.2006.1652218

Granular best match algorithm for context-aware computing systems. / Kocaballi, A. Baki; Koçyiǧit, Altan.

PERSER '06 Proceedings of the 2006 ACS/IEEE International Conference on Pervasive Services. Vol. 2006 Institute of Electrical and Electronics Engineers (IEEE), 2006. p. 143-149 1652218.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Granular best match algorithm for context-aware computing systems

AU - Kocaballi, A. Baki

AU - Koçyiǧit, Altan

PY - 2006/12/1

Y1 - 2006/12/1

N2 - In order to be context-aware, a system or application should adapt its behavior according to current context, changing over time. Current context is acquired by some context provision mechanisms like sensors or other applications. 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.

AB - In order to be context-aware, a system or application should adapt its behavior according to current context, changing over time. Current context is acquired by some context provision mechanisms like sensors or other applications. 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.

KW - Context matching

KW - Context-aware computing

KW - Context-awareness

KW - Pervasive computing

UR - http://www.scopus.com/inward/record.url?scp=33845964475&partnerID=8YFLogxK

U2 - 10.1109/PERSER.2006.1652218

DO - 10.1109/PERSER.2006.1652218

M3 - Conference proceeding contribution

AN - SCOPUS:33845964475

SN - 1424402379

SN - 9781424402373

VL - 2006

SP - 143

EP - 149

BT - PERSER '06 Proceedings of the 2006 ACS/IEEE International Conference on Pervasive Services

PB - Institute of Electrical and Electronics Engineers (IEEE)

T2 - ICPS:2006 International Conference on Pervasive Services

Y2 - 26 June 2006 through 29 June 2006

ER -