Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Granular best match algorithm for context-aware computing systems
Date
2006-06-29
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
92
views
0
downloads
Cite This
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.
Subject Keywords
Pervasive computing
,
Context-aware computing
,
Context-awareness
,
Context matching
URI
https://hdl.handle.net/11511/55324
Conference Name
3rd IEEE International Conference on Pervasive Services (ICPS 2006)
Collections
Graduate School of Informatics, Conference / Seminar
Suggestions
OpenMETU
Core
Granular best match algorithm for context-aware computing systems
Kocaballi, A. Baki; Koçyiğit, Altan (2007-12-01)
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 use...
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 ...
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...
Dynamic constraint satisfaction algorithm for reconfiguration of feature models
Entekhabi, Sina; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2018)
Dynamically reconfigurable systems are able to respond to changes in their operational environments by reconfiguring themselves automatically. Dynamic software product lines are dynamically reconfigurable systems with an explicit variability model that guides the reconfiguration. In this work, feature models are used as the variability model. Features are assumed to be mapped to system's components that realize them. A feature model corresponds to a constraint satisfaction problem (CSP), and determines the ...
ANFIS_unfolded_in_time for multivariate time series forecasting
Sisman-Yilmaz, Na; Alpaslan, Ferda Nur; Jain, L (Elsevier BV, 2004-10-01)
This paper proposes a temporal neuro-fuzzy system named ANFIS_unfolded_in_time which is designed to provide an environment that keeps temporal relationships between the variables and to forecast the future behavior of data by using fuzzy rules. It is a modification of ANFIS neuro-fuzzy model. The rule base of ANFIS_unfolded_in_time contains temporal TSK(Takagi-Sugeno-Kang) fuzzy rules. In the training phase, back-propagation learning algorithm is used. The system takes the multivariate data and the number o...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
A. B. Kocaballi and A. Koçyiğit, “Granular best match algorithm for context-aware computing systems,” presented at the 3rd IEEE International Conference on Pervasive Services (ICPS 2006), Lyon, FRANCE, 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/55324.
