Model ensemble for an effective on-line reconstruction of missing data in sensor networks

class class point Model ensemble for an effective on-line reconstruction of missing data in sensor networks Author 1, Author 2, Author 3 Affiliation Sensing node 2 Sensing node 2 k-NN classifiers associate a classification label to an input as the majority of its k nearest training samples No proper training phase – Reduced computational complexity Consistency: Bayes errore Sensing node 1 Sensing node 1 Sensing node 3 Sensing node 3 Cluster head Cluster head Leave-One-Out (LOO) Fukunaga et Al. Lack of theoretical results Sensing node 5 Sensing node 4 Sensing node 5 Sensing node 4 How to select k given n? The proposed algorithm Network in stationary conditions . The Distributed Change-Detection Test: Each unit: configure the ICI-based CDT using {, 1≤ i≤ N}; Each unit: send feature extracted from to the cluster-head. while(units acquire new observations at time T){ Each unit: run the ICI-based CDT at time T; let ST be the set of units where the ICI-based CDT detects a change at time T; if (ST is not empty) { Each unit in ST: run the refinement procedure, sent Tref,i to the cluster-head. Cluster-head: compute Tref out of Tref,i, 1≤ i≤ N , send Tref to each unit. Each unit: send to the cluster-head the values in [Tref ,T] of the feature detecting the change. Cluster-head: run the Hotelling T2 test to assess stationarity of features if (second-level test detects a change){ Change is validated. Each unit in ST the ICI-based CDT is re-trained on the new process status} else{ Change is discarded (false positive); Each unit in ST: reconfigure the ICI-based CDT to improve its performance }}} Configuration H.T. Execution Experimental Results a) a mono-dimensional classification problem with equi-probable classes ruled by Gaussian distributions (with T=[-4,6]: , b) a two-dimensional classification problem characterized by the two equi-probable classes ruled by chi-square distributions: The theoretical derivation is experimentally sound Number of k within [Pe(ko),Pe(ko)+δ] ko w.r.t. n Pe(k) w.r.t. k Number of k within [Pe(ko),Pe(ko)+δ] ko w.r.t. n Pe(k) w.r.t. k

Model ensemble for an effective on-line reconstruction of missing data in sensor networks

Model ensemble for an effective on-line reconstruction of missing data in sensor networks

Presentation Transcript

Sensor Data Management In Sensor Networks

Data Management in Sensor Networks

Data Dissemination in Vehicular Sensor Networks

A geometric model for on-line social networks

The geometric protean model for on-line social networks

Uncertain Data Management for Sensor Networks

Distributed Data Classification in Sensor Networks

On Computing Compression Trees for Data Collection in Wireless Sensor Networks

Data centric Storage In Sensor networks

Reconstruction of Voxels from Sensor Data

Model-driven Data Acquisition in Sensor Networks

LPT for Data Aggregation in Wireless Sensor networks

Querying Sensor Data in Smartphone Networks

Model Based Techniques for DATA RELIABILITY in Wireless Sensor Networks.

Scalable Data Collection in Sensor Networks

Data-Driven Processing in Sensor Networks

JP1.29 EFFECTIVE USE OF REGIONAL ENSEMBLE DATA IN FORECASTING

An Improved TCP for transaction communications on Sensor Networks

Model ensemble for an effective on-line reconstruction of missing data in sensor networks

Data Aggregation In Wireless Sensor Networks

Model ensemble for an effective on-line reconstruction of missing data in sensor networks

On Concealed Data Aggregation for Wireless Sensor Networks