Algorithms for rule generation and matchmaking in context-aware system

14Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

To solve the problem that rules in the existing context-aware systems are manually specified by developers or users, an automatic rule generation method is proposed. Context-Aware systems are regarded as decision systems, and context information are reduced with discernibility matrix so as to generate rules. Because the data that can be utilized are limited, the generated rules can not entirely cover the domains of contexts. The rule matches current context probably does not exist. A rule matching algorithm is presented as the solution to this problem. Finally, the efficiency and effectivity of the proposed method is verified. © by Institute of Software, the Chinese Academy of Sciences. All rights reserved.

Cite

CITATION STYLE

APA

Liu, D., Meng, X. W., Chen, J. L., & Xia, Y. M. (2009). Algorithms for rule generation and matchmaking in context-aware system. Ruan Jian Xue Bao/Journal of Software, 20(10), 2655–2666. https://doi.org/10.3724/SP.J.1001.2009.03436

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free