scispace - formally typeset
Open AccessJournal ArticleDOI

Recover Corrupted Data in Sensor Networks: A Matrix Completion Solution

TLDR
A two-phase MC-based data recovery scheme, named MC-Two-Phase, which applies the matrix completion technique to fully exploit the inherent features of environmental data to recover the data matrix due to either data missing or corruption is proposed.
Abstract
Affected by hardware and wireless conditions in WSNs, raw sensory data usually have notable data loss and corruption. Existing studies mainly consider the interpolation of random missing data in the absence of the data corruption. There is also no strategy to handle the successive missing data. To address these problems, this paper proposes a novel approach based on matrix completion (MC) to recover the successive missing and corrupted data. By analyzing a large set of weather data collected from 196 sensors in Zhu Zhou, China, we verify that weather data have the features of low-rank, temporal stability, and spatial correlation. Moreover, from simulations on the real weather data, we also discover that successive data corruption not only seriously affects the accuracy of missing and corrupted data recovery but even pollutes the normal data when applying the matrix completion in a traditional way. Motivated by these observations, we propose a novel Principal Component Analysis (PCA)-based scheme to efficiently identify the existence of data corruption. We further propose a two-phase MC-based data recovery scheme, named MC-Two-Phase, which applies the matrix completion technique to fully exploit the inherent features of environmental data to recover the data matrix due to either data missing or corruption. Finally, the extensive simulations with real-world sensory data demonstrate that the proposed MC-Two-Phase approach can achieve very high recovery accuracy in the presence of successively missing and corrupted data.

read more

Citations
More filters
Journal ArticleDOI

Review of Current Technologies and Proposed Intelligent Methodologies for Water Distributed Network Leakage Detection

TL;DR: This paper attempts to review the current technologies for leakage detection in WDN as well as several proposed intelligent methodologies (such as support vector machine, neural network, and convolution neural network) over the past few years.
Journal ArticleDOI

An AUV-Assisted Data Gathering Scheme Based on Clustering and Matrix Completion for Smart Ocean

TL;DR: An autonomous underwater vehicle-assisted data gathering scheme based on clustering and matrix completion (ACMC) to improve the data gathering efficiency in the underwater wireless sensor network (UWSN) and presents an in-cluster data collection mechanism based on matrix completion.
Journal ArticleDOI

Edge-based differential privacy computing for sensor–cloud systems

TL;DR: An edge-based model for data collection, in which the raw data from wireless sensor networks is differentially processed by algorithms on edge servers for privacy computing, and the data privacy is preserved since the original data cannot be retrieved even if the data stored in the cloud is leaked.
Journal ArticleDOI

Fast Tensor Factorization for Accurate Internet Anomaly Detection

TL;DR: TensorDet can achieve significantly lower false positive rate and higher true positive rate, and benefiting from the well designed algorithm to reduce the computation cost of tensor factorization, the tensorFactorization process in TensorDet is 5 (Abilene) and 13 (GÈANT) times faster than that of the traditional Tucker decomposition solution.
References
More filters
Journal ArticleDOI

Nearest neighbor pattern classification

TL;DR: The nearest neighbor decision rule assigns to an unclassified sample point the classification of the nearest of a set of previously classified points, so it may be said that half the classification information in an infinite sample set is contained in the nearest neighbor.
Journal ArticleDOI

A Singular Value Thresholding Algorithm for Matrix Completion

TL;DR: This paper develops a simple first-order and easy-to-implement algorithm that is extremely efficient at addressing problems in which the optimal solution has low rank, and develops a framework in which one can understand these algorithms in terms of well-known Lagrange multiplier algorithms.
Journal ArticleDOI

Exact Matrix Completion via Convex Optimization

TL;DR: It is proved that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries, and that objects other than signals and images can be perfectly reconstructed from very limited information.
Journal ArticleDOI

Exact matrix completion via convex optimization

TL;DR: In this paper, a convex programming problem is used to find the matrix with the minimum nuclear norm that is consistent with the observed entries in a low-rank matrix, which is then used to recover all the missing entries from most sufficiently large subsets.
Journal ArticleDOI

Matrix Completion With Noise

TL;DR: This paper surveys the novel literature on matrix completion and introduces novel results showing that matrix completion is provably accurate even when the few observed entries are corrupted with a small amount of noise, and shows that, in practice, nuclear-norm minimization accurately fills in the many missing entries of large low-rank matrices from just a few noisy samples.
Related Papers (5)