Tree Alignment Based on Needleman-Wunsch Algorithm for Sensor Selection in Smart Homes
نویسندگان
چکیده
Activity recognition in smart homes aims to infer the particular activities of the inhabitant, the aim being to monitor their activities and identify any abnormalities, especially for those living alone. In order for a smart home to support its inhabitant, the recognition system needs to learn from observations acquired through sensors. One question that often arises is which sensors are useful and how many sensors are required to accurately recognise the inhabitant's activities? Many wrapper methods have been proposed and remain one of the popular evaluators for sensor selection due to its superior accuracy performance. However, they are prohibitively slow during the evaluation process and may run into the risk of overfitting due to the extent of the search. Motivated by this characteristic, this paper attempts to reduce the cost of the evaluation process and overfitting through tree alignment. The performance of our method is evaluated on two public datasets obtained in two distinct smart home environments.
منابع مشابه
Comparison of Sequence Similarity Measures for Distant Evolutionary Relationships
Sequence similarity algorithms are used to reconstruct increasing large evolutionary trees involving increasingly distant evolutionary relationships. This paper proposes two sequence similarity algorithms, called the Greedy Tiling and the Random Tiling algorithms, that are both based on the idea of tiling one sequence by parts of another sequence. Experimental comparisons show that the new algo...
متن کاملPart I : Pairwise Global Alignment with the Needleman - Wunsch
To understand the value of aligning genes and recognize the practical applications of this technique. To gain familiarity with the use of Web-based alignment tools to explore sequence similarity and understand how to modify their parameters. To know how the Needleman-Wunsch algorithm optimally aligns any two sequences. Understand how the Needleman-Wunsch algorithm can be modified to yie...
متن کاملParalellization of Needleman-Wunsch String Alignment Method
The identification of homologies between protein sequences is a central problem in molecular biology and several algorithms have been proposed for accomplishing this task. The Needleman-Wunsch Algorithm and its close variant, the SmithWaterman dynamic programming methods, solve the problem exactly in quadratic time and space. However, due to the massive amount of data involved in sequence-to-da...
متن کاملOn the use of don ' t care regions for protein sequence alignment
We present a general algorithm to align two protein sequences that uses the concept of don't care regions. It is based on the classical Needleman-Wunsch dynamic programming method using aane penalty functions. We tested the algorithm on two problems, comparing it against the standard dynamic programming algorithm. Results were not consistently or signiicantly better, suggesting that reenements ...
متن کاملAcceleration of Biological Sequence Alignment using Recursive Variable Expansion
Biological sequence alignment is one of the most important problems in computational biology. Given two sequences of varying length are aligned such that the alignment score is maximum. The alignment score is calculated based on the number of matches, mismatches and gaps in the alignment suggested. The basic sequence alignment algorithms are Needleman-Wunsch (NW) algorithm and Smith-Waterman (S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 17 شماره
صفحات -
تاریخ انتشار 2017