Multi-Attribute Missing Data Reconstruction Based on Adaptive Weighted Nuclear Norm Minimization in IoT

被引:6
作者
Yu, Xiang [1 ]
Fan, Xia [1 ]
Chen, Kan [1 ]
Duan, Sirui [1 ]
机构
[1] Chongqing Univ Posts & Telecommun, Sch Commun & Informat Engn, Chongqing 400065, Peoples R China
来源
IEEE ACCESS | 2018年 / 6卷
关键词
Data reconstruction; Internet of Things (IoT); K-means; multi-attribute; tensor completion; weighted nuclear norm minimization (WNNM); SURFACE COVERAGE; SENSOR; INTERNET; THINGS;
D O I
10.1109/ACCESS.2018.2876701
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the Internet of Things, data sets gathered from sensor nodes are missing a significant fraction of data, owing to noise, collision, unreliable links, and unexpected damage. This phenomenon is more serious in some scenarios, which limits the applications of sensor data. It is therefore necessary to develop methods to reconstruct these lost data with high accuracy. In this paper, a new multi-attribute missing data reconstruction method based on adaptive weighted nuclear norm minimization is developed, and a K-means clustering analysis is embedded into this forecasting process to improve the prediction accuracy. First, to ensure that sensors in one group have similar patterns of measurement, we use a traditional machine learning algorithm, called K-means clustering algorithm to separate sensors into different groups. Second, considering the correlations among multiple attributes of sensor data and its joint low-rank characteristics, we propose an algorithm based on the matrix rank-minimization method of automatic weighted nuclear norm minimization, which adaptively assigns different weights to each singular value simultaneously. Moreover, we use the alternating direction method of multipliers to obtain its optimal solution. Finally, we evaluate the proposed method by using a real sensor data set from the Intel Berkeley Research Laboratory with two missing patterns, namely, random missing pattern and consecutive missing pattern. The simulation results prove that our algorithm performs well even with a small number of samples, and it can propagate through a structure to fill in large missing regions.
引用
收藏
页码:61419 / 61431
页数:13
相关论文
共 37 条
  • [1] [Anonymous], 2017, LECT NOTES I COMPUTE
  • [2] The Internet of Things: A survey
    Atzori, Luigi
    Iera, Antonio
    Morabito, Giacomo
    [J]. COMPUTER NETWORKS, 2010, 54 (15) : 2787 - 2805
  • [3] ALMANAC: Internet of Things for Smart Cities
    Bonino, Dario
    Alizo, Maria Teresa Delgado
    Alapetite, Alexandre
    Gilbert, Thomas
    Axling, Mathias
    Udsen, Helene
    Soto, Jose Angel Carvajal
    Spirito, Maurizio
    [J]. 2015 3RD INTERNATIONAL CONFERENCE ON FUTURE INTERNET OF THINGS AND CLOUD (FICLOUD) AND INTERNATIONAL CONFERENCE ON OPEN AND BIG (OBD), 2015, : 309 - 316
  • [4] A SINGULAR VALUE THRESHOLDING ALGORITHM FOR MATRIX COMPLETION
    Cai, Jian-Feng
    Candes, Emmanuel J.
    Shen, Zuowei
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2010, 20 (04) : 1956 - 1982
  • [5] Candes E. J., 2009, ALL C COMM CONTR COM, P806
  • [6] Chen GS, 2013, IEEE GLOB COMM CONF, P103, DOI 10.1109/GLOCOM.2013.6831055
  • [7] Chen J., 2016, P CHINA NAT KNOWL IN
  • [8] A Vision of IoT: Applications, Challenges, and Opportunities With China Perspective
    Chen, Shanzhi
    Xu, Hui
    Liu, Dake
    Hu, Bo
    Wang, Hucheng
    [J]. IEEE INTERNET OF THINGS JOURNAL, 2014, 1 (04): : 349 - 359
  • [9] Chu E, 2011, CONSENSUS BASED ADMM
  • [10] NEAREST NEIGHBOR PATTERN CLASSIFICATION
    COVER, TM
    HART, PE
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) : 21 - +