DocumentCode :
604765
Title :
Extraction of latent patterns and contexts from social honest signals using hierarchical Dirichlet processes
Author :
Thuong Nguyen ; Dinh Phung ; Gupta, Swastik ; Venkatesh, Svetha
Author_Institution :
Centre for Pattern Recognition & Data Analytics, Deakin Univ., Melbourne, VIC, Australia
fYear :
2013
fDate :
18-22 March 2013
Firstpage :
47
Lastpage :
55
Abstract :
A fundamental task in pervasive computing is reliable acquisition of contexts from sensor data. This is crucial to the operation of smart pervasive systems and services so that they might behave efficiently and appropriately upon a given context. Simple forms of context can often be extracted directly from raw data. Equally important, or more, is the hidden context and pattern buried inside the data, which is more challenging to discover. Most of existing approaches borrow methods and techniques from machine learning, dominantly employ parametric unsupervised learning and clustering techniques. Being parametric, a severe drawback of these methods is the requirement to specify the number of latent patterns in advance. In this paper, we explore the use of Bayesian nonparametric methods, a recent data modelling framework in machine learning, to infer latent patterns from sensor data acquired in a pervasive setting. Under this formalism, nonparametric prior distributions are used for data generative process, and thus, they allow the number of latent patterns to be learned automatically and grow with the data - as more data comes in, the model complexity can grow to explain new and unseen patterns. In particular, we make use of the hierarchical Dirichlet processes (HDP) to infer atomic activities and interaction patterns from honest signals collected from sociometric badges. We show how data from these sensors can be represented and learned with HDP. We illustrate insights into atomic patterns learned by the model and use them to achieve high-performance clustering. We also demonstrate the framework on the popular Reality Mining dataset, illustrating the ability of the model to automatically infer typical social groups in this dataset. Finally, our framework is generic and applicable to a much wider range of problems in pervasive computing where one needs to infer high-level, latent patterns and contexts from sensor data.
Keywords :
data mining; learning (artificial intelligence); nonparametric statistics; pattern classification; pattern clustering; statistical distributions; ubiquitous computing; Bayesian nonparametric methods; HDP; atomic activity; atomic patterns; clustering techniques; data generative process; data modelling framework; fundamental task; hierarchical Dirichlet processes; high-performance clustering; interaction patterns; latent pattern extraction; machine learning; nonparametric prior distributions; parametric unsupervised learning; pervasive computing; pervasive setting; raw data; reality mining dataset; sensor data; smart pervasive services; smart pervasive systems; social groups; social honest signals; sociometric badges; Accelerometers; Bayes methods; Bluetooth; Context; Data mining; Data models; Hidden Markov models;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Pervasive Computing and Communications (PerCom), 2013 IEEE International Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4673-4573-6
Electronic_ISBN :
978-1-4673-4574-3
Type :
conf
DOI :
10.1109/PerCom.2013.6526713
Filename :
6526713
Link To Document :
بازگشت