EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


16525 Sensor Data Management with Probabilistic Models
Home Policy Brochure Browse Search User Area Contact Help

Evers, S. (2009) Sensor Data Management with Probabilistic Models. PhD thesis, University of Twente. CTIT Ph.D.-thesis series No. 09-150 ISBN 978-90-365-2867-2

Full text available as:

PDF
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
848 Kb

Official URL: http://dx.doi.org/10.3990/1.9789036528672

Exported to Metis

Abstract

The anticipated 'sensing environments' of the near future pose new requirements to the data management systems that mediate between sensor data supply and demand sides. We identify and investigate one of them: the need to deal with the inherent uncertainty in sensor data due to measurement noise, missing data, the semantic gap between the measured data and relevant information, and the integration of data
from different sensors.

Probabilistic models of sensor data can be used to deal with these uncertainties in the well-understood and fruitful framework of probability theory. In particular, the Bayesian network formalism proves useful for modeling sensor data in a flexible environment, because of its comprehensiveness and modularity. We provide extensive technical argumentation for this claim. As a demonstration case, we define a discrete Bayesian network for location tracking using Bluetooth transceivers.

In order to scale up sensor models, efficient probabilistic inference on the Bayesian network is crucial. However, we observe that the conventional inference methods do not scale well for our demonstration case. We propose several optimizations, making it possible to jointly scale up the number of locations and sensors in sublinear time, and to scale up the time resolution in linear time. Moreover, we define a theoretical framework in which these optimizations are derived by translating an inference query into relational algebra. This allows the query to be analyzed and optimized using insights and techniques from the database community; for example, using cost metrics based on cardinality rather than dimensionality.

An orthogonal research question investigates the possibility of collecting transition statistics in a local, clustered fashion, in which transitions between states of different clusters cannot be directly observed. We show that this problem can be written as a constrained system of linear equations, for which we describe a specialized solution method.

Item Type:PhD Thesis
Supervisors:Apers, P.M.G. and Feng, Ling
Assistant Supervisors:Fokkinga, M.M.
Research Group:EWI-DB: Databases
Research Program:CTIT-NICE: Natural Interaction in Computer-mediated Environments
Research Project:CADMAI: Towards Context-Aware Data Management for Ambient Intelligence
Additional Information:SIKS Dissertation Series No. 2009-28
Uncontrolled Keywords:sensor data, probabilistic models, dynamic bayesian networks
ID Code:16525
Deposited On:17 November 2009
More Information:statisticsmetis

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item