شناخت رفتار ناشی از انسان در خانه های هوشمند: یک روش داده کاوی
|کد مقاله||سال انتشار||تعداد صفحات مقاله انگلیسی||ترجمه فارسی|
|21405||2007||22 صفحه PDF||سفارش دهید|
نسخه انگلیسی مقاله همین الان قابل دانلود است.
هزینه ترجمه مقاله بر اساس تعداد کلمات مقاله انگلیسی محاسبه می شود.
این مقاله تقریباً شامل 10075 کلمه می باشد.
هزینه ترجمه مقاله توسط مترجمان با تجربه، طبق جدول زیر محاسبه می شود:
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Pervasive and Mobile Computing, Volume 3, Issue 2, March 2007, Pages 95–116
Motivated by a growing need for intelligent housing to accommodate ageing populations, we propose a novel application of intertransaction association rule (IAR) mining to detect anomalous behaviour in smart home occupants. An efficient mining algorithm that avoids the candidate generation bottleneck limiting the application of current IAR mining algorithms on smart home data sets is detailed. An original visual interface for the exploration of new and changing behaviours distilled from discovered patterns using a new process for finding emergent rules is presented. Finally, we discuss our observations on the emergent behaviours detected in the homes of two real world subjects.
Current trends suggest that the global population will consist predominately of older people, those aged sixty and over, in as little as fifty years . This demographic shift is expected to lead to an increase in the need for smart homes; intelligent environments that are able to assist their occupants in maintaining independent lifestyles for as long as possible . In our work, we seek to facilitate the creation of homes that are able to detect the presence of new, possibly abnormal, behaviour in their occupants and to take action accordingly. Appropriate action may be to query the occupant on the new behaviour, to jog their memory on a task that they were carrying out or even to alert an occupant’s relative that their assistance is required. Detecting such deviations from normal behaviour requires models of a person’s expected behaviour to compare with incoming data. One of the more popular approaches favoured by researchers for modelling human behaviour has been the application of graphical models. Training and inferencing using these models is, however, computationally expensive and generally limited to applications in which it is reasonable to assume that human activity can be represented as sequences of asynchronous activities or events. The task of modelling human behaviour as precise sequences of events is made difficult, however, by our tendency to interleave our activities and to adjust our behaviour when we are interrupted. We propose a novel application of Intertransaction Association Rule (IAR) mining  as a means of tackling this issue. IARs are implication rules that allow us to capture the associative, non-sequential, relationship of events observed within a home while retaining some of the higher level temporal context in which these events occur. The research contributions of this work are threefold. The first addresses the issue of mining the IARs present in the sensor event logs from a home. Such environments generate data sets that contain frequent occurrences of a large number of events over relatively short periods. This poses a problem for the current EH-Apriori  and FITI  algorithms for IAR mining as they rely on a computationally costly candidate-generation-then-test approach for rule discovery. This technique requires that kk passes over a database are made to retrieve the set of frequent rules up to length kk. Each pass over the data requires the generation of candidates — the set of all possibly frequent associations given those found in a previous pass. The scalability of such algorithms is hence limited due to the computational complexity of generating and testing the frequency of a combinatorial number of candidates. The number of candidates generated at each pass kk of a worst case scenario given nn database items and an intertransaction window of length ww is View the MathML source∑r=0k−1[nknwr]. We propose the application of our Extended Frequent Pattern Tree (EFP-Tree)  as a means of tackling this issue. The EFP-Tree is an extension of the Frequent Pattern Tree (FP-Tree)  for IAR mining. It uses a divide and conquer approach to avoid candidate generation and requires only three passes over a database. The second issue we face is how to gain insight into a person’s behaviour so as to detect abnormality from an overwhelming number of rules that the mining process is likely to uncover. We introduce the use of emergent IARs as a novel means of finding patterns of behaviour that are of interest to us. Emergent IARs are those rules that display significant growth from one data set to another. Their presence may indicate abnormality evident as either a previously unseen pattern of events or unusually frequent occurrences of behaviour that would otherwise be considered normal. Emergent IARs offer a convenient means of identifying changes that would otherwise be difficult to discern through manual inspection of the rule sets. For example, the real world event logs from a single week of data can produce around 7200 patterns which can be distilled down to approximately 150 emergent rules that are likely to be of interest to us. The same data set mined with a slightly higher support threshold will retrieve 46 emergent rules from circa 2700 discovered patterns. We further build on this with the introduction of a novel graphical interface that maps the emergent rules back onto the original data. Visualisation on the original data space is important in our application as it enables users to see implications of patterns that are not immediately apparent from uncovered rules. We have used our system for the discovery and analysis of emergent IARs to investigate the emergent human behaviour from a real world smart home data set. Experimental results show that we are able to detect emergent IARs that indicate both previously unseen behaviours and sensor aberrations.
نتیجه گیری انگلیسی
This paper has introduced a novel data mining approach for the detection of new and changing behaviour in people living in a smart home. We presented the EFP-Tree, an extension of the FP-Tree for intertransaction mining, and the corresponding EFP-Growth algorithm for the efficient retrieval of frequent IAR patterns from the tree structure. The EFP-Tree was shown to be an order of magnitude computationally more efficient at mining IARs from both synthetic data and from event data collected in a smart home environment than the existing EH-Apriori  and FITI  algorithms. A method for finding IAR patterns exhibiting significant growth from one data set to another was also introduced. These emergent IARs allow us to detect the presence of new, possibly anomalous, behaviour and unusually frequent occurrences of behaviour that would otherwise be considered normal from amongst the mined rules. Emergent IARs are important in our work as they provide a means of distilling many discovered rules down to those most likely to be of interest to us. A novel visual data mining tool that maps the discovered emergent IARs back onto the original data space was discussed. We found that the use of this interface allowed us to obtain clearer insight into the emergent rules than through manual inspection of the event logs. Observations made on the emergent IARs discovered in the sensor event logs from the homes of a working professional and an elderly retiree volunteer were discussed. We demonstrated that emergent behaviours due to both sensor aberrations and real changes in behaviour could be detected. At least one behaviour, documented in Section 7.2.1, warranting concern for the well-being of the elderly subject was discovered.