AAL Data Cluster Analysis. Theory and Implementation - Hamzic, Dzenan
27,95 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 1-2 Wochen
payback
0 °P sammeln
  • Broschiertes Buch

Bachelor Thesis from the year 2016 in the subject Computer Science - Applied, grade: 1, Vienna University of Technology, language: English, abstract: The e-Home project from the Vienna University of Technology is an R&D project with goals of providing assistive technologies for private households of older people with the idea to give them possibilities for longer and independent living in their homes. The e-Home system consists of an adaptive intelligent network of wireless sensors for activity monitoring with a central context-aware embedded system. The primary goal of this thesis is to…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
Bachelor Thesis from the year 2016 in the subject Computer Science - Applied, grade: 1, Vienna University of Technology, language: English, abstract: The e-Home project from the Vienna University of Technology is an R&D project with goals of providing assistive technologies for private households of older people with the idea to give them possibilities for longer and independent living in their homes. The e-Home system consists of an adaptive intelligent network of wireless sensors for activity monitoring with a central context-aware embedded system. The primary goal of this thesis is to investigate unsupervised prediction and clustering possibilities of user behaviour based on collected time-series data from infrared temperature sensors in the e-Home enviroment. Three different prediction approaches are described. Hourly Based Event Binning approach is compared to two clustering algorithms, Hierarchical Clustering and Dirichlet Process GMM. Prediction rates are measured on data from three different test persons. This thesis first examines two different approaches for event detection from infrared signal data. In a second stage three different methods for unsupervised prediction analytics are discussed and tested on selected data-sets. Clustering algorithms parameter settings for time-series data have also been discussed and tested in detail. Finally the prediction performance results are compared and each method's advantages and disadvantages have been discussed. The practical part of this thesis is implemented in IPython notebook. Python version was 2.7 on 64 bit Ubuntu linux 12.04 LTS. Data analysis has been implemented with Python's Pandas library. Visualisations are made with Matplotlib and Seaborn libraries. The results reveal that prediction accuracy depends on data quantity and spread of data points. The simplest method in prediction comparison, the Hourly Based Binning has however given the best prediction rates overall. The Dirichlet Process Gaussian Mixture Models clustering show best prediction performance on smaller training data sets and well spread data. By further parameter tuning on Dirichlet Process GMM clustering the prediction rates could be further improved coming very close or even over performing the Hourly Based Binning. Due to the unknown distribution and well spread data, choosing the right threshold parameter for the Hierarchical Clustering was trickier than initially assumed. Despite the initial assumptions for Hierarchical Clustering, this method was at least applicable for unsupervised prediction analytics on used data sets.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.