Granular best match algorithm for context-aware computing systems

Date

2007-12-01

Author

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

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

95
views

0
downloads

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.

Subject Keywords

Context matching, Context-awareness, Pervasive computing

URI

https://hdl.handle.net/11511/30814

Journal

JOURNAL OF SYSTEMS AND SOFTWARE

DOI

https://doi.org/10.1016/j.jss.2007.03.006

Collections

Graduate School of Informatics, Article

Suggestions

OpenMETU
Core

Granular best match algorithm for context-aware computing systems Kocaballi, A. Baki; Koçyiğit, Altan (2006-06-29) 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 int...
Interactive evolutionary approaches to multi-objective feature selection Özmen, Müberra; Köksalan, Murat; Karakaya, Gülşah; Department of Industrial Engineering (2016) In feature selection problems, the aim is to select a subset of features to characterize an output of interest. In characterizing an output, we may want to consider multiple objectives such as maximizing classification performance, minimizing number of selected features or cost, etc. We develop a preference-based approach for multi-objective feature selection problems. Finding all Pareto optimal subsets may turn out to be a computationally demanding problem and we still would need to select a solution event...
Controller synthesis for an I/O-based hierarchical system architecture Perk, Sebastian; Moor, Thomas; Schmidt, Klaus Verner (2008-10-08) In our previous work, a framework for the hierarchical design of discrete event systems has been introduced that is based on a notion of inputs and outputs. I/O-plant models describe the interaction of each subsystem with the operator (or controller) and the environment. By alternation of subsystem composition and controller synthesis, a hierarchy of controllers is obtained that complements a hierarchy of environment models. An admissibility condition was presented that implies liveness while allowing for a...
Interactive algorithms for a broad underlying family of preference functions Karakaya, Gülşah; AHİPAŞAOĞLU, Selin Damla (Elsevier BV, 2018-02-16) In multi-criteria decision making approaches it is typical to consider an underlying preference function that is assumed to represent the decision maker's preferences. In this paper we introduce a broad family of preference functions that can represent a wide variety of preference structures. We develop the necessary theory and interactive algorithms for both the general family of the preference functions and for its special cases. The algorithms guarantee to find the most preferred solution (point) of the ...
Uncertainty quantification of parameters in local volatility model via frequentist, bayesian and stochastic galerkin methods Animoku, Abdulwahab; Uğur, Ömür; Department of Financial Mathematics (2018) In this thesis, we investigate and implement advanced methods to quantify uncertain parameter(s) in Dupire local volatility equation. The advanced methods investigated are Bayesian and stochastic Galerkin methods. These advanced techniques implore different ideas in estimating the unknown parameters in PDEs. The Bayesian approach assumes the parameter is a random variable to be sampled from its posterior distribution. The posterior distribution of the parameter is constructed via “Bayes theorem of inverse p...

Citation Formats

A. B. Kocaballi and A. Koçyiğit, “Granular best match algorithm for context-aware computing systems,” JOURNAL OF SYSTEMS AND SOFTWARE, pp. 2015–2024, 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/30814.