A service scenario generation scheme based on association rule mining for elderly surveillance system in a smart home environment

  • Authors:
  • Kyung Jin Kang;Borey Ka;Sung Jo Kim

  • Affiliations:
  • Department of Computer Science & Engineering, Chung-Ang University, Republic of Korea;Department of Computer Science & Engineering, Chung-Ang University, Republic of Korea;Department of Computer Science & Engineering, Chung-Ang University, Republic of Korea

  • Venue:
  • Engineering Applications of Artificial Intelligence
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

More convenient smart home environments can be constructed by monitoring home appliances, if automated services are supported by their usage information. This paper proposes a scheme for translating association rules among appliances mined from their usage information into service scenarios. A smart home environment is unique in that there exist a limited number of home appliances, some of which operate without interruption like a refrigerator. Furthermore, the number of home appliances is much less than the number of items in itemsets to which existing algorithms for mining association rules have been applied. After showing that the existing algorithms are limited in improving the usefulness of association rule generation by means of adjusting the confidence level due to such unique characteristics, we propose a new service scenario generation scheme which calculates the confidence level based on hypothesis testing. This paper demonstrates that association rule mining based on the dependence between appliances is feasible and its performance is very much comparable with that of an existing association rule mining algorithm. Since home users are allowed to choose their favorable scenarios from meaningful service scenarios generated by the proposed scheme without their intervention, we expect that future smart homes can provide automated services more efficiently to them, especially to surveillance systems for elderly.