L1-Subspace Tracking for Streaming Data

被引:6
作者
Liu, Ying [1 ]
Tountas, Konstantinos [2 ]
Pados, Dimitris A. [2 ]
Batalama, Stella N. [2 ]
Medley, Michael J. [3 ]
机构
[1] Santa Clara Univ, Dept Comp Sci & Engn, Santa Clara, CA 95053 USA
[2] Florida Atlantic Univ, Dept Comp & Elect Engn & Comp Sci, Boca Raton, FL 33431 USA
[3] SUNY Polytech Inst, Dept Engn, Utica, NY 13502 USA
基金
美国国家科学基金会;
关键词
Dimensionality reduction; Eigenvector decomposition; Internet-of-Things; L-1-norm; Outliers; Principal-component analysis; Subspace learning; ROBUST; FACTORIZATION; ALGORITHM; OUTLIERS;
D O I
10.1016/j.patcog.2019.106992
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
High-dimensional data usually exhibit intrinsic low-rank structures. With tremendous amount of streaming data generated by ubiquitous sensors in the world of Internet-of-Things, fast detection of such low-rank pattern is of utmost importance to a wide range of applications. In this work, we present an L-1-subspace tracking method to capture the low-rank structure of streaming data. The method is based on the L-1-norm principal-component analysis (L-1-PCA) theory that offers outlier resistance in subspace calculation. The proposed method updates the L-1-subspace as new data are acquired by sensors. In each time slot, the conformity of each datum is measured by the L-1-subspace calculated in the previous time slot and used to weigh the datum. Iterative weighted L-1-PCA is then executed through a refining function. The superiority of the proposed L-1-subspace tracking method compared to existing approaches is demonstrated through experimental studies in various application fields. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:13
相关论文
共 39 条
[1]   A survey on spectrum management in cognitive radio networks [J].
Akyildiz, Ian F. ;
Lee, Won-Yeol ;
Vuran, Mehmet C. ;
Mohanty, Shantidev .
IEEE COMMUNICATIONS MAGAZINE, 2008, 46 (04) :40-48
[2]  
[Anonymous], 2013, ADV NEURAL INFORM PR
[3]   Incremental subspace learning via non-negative matrix factorization [J].
Bucak, Serhat S. ;
Gunsel, Bilge .
PATTERN RECOGNITION, 2009, 42 (05) :788-797
[4]   Robust Principal Component Analysis? [J].
Candes, Emmanuel J. ;
Li, Xiaodong ;
Ma, Yi ;
Wright, John .
JOURNAL OF THE ACM, 2011, 58 (03)
[5]  
Chenlu Qiu, 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), P752
[6]  
Chenlu Qiu, 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), P591, DOI 10.1109/ALLERTON.2010.5706961
[7]  
Chouvardas Symeon, 2014, 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), P5497, DOI 10.1109/ICASSP.2014.6854654
[8]   Efficient Computation of Robust Low-Rank Matrix Approximations in the Presence of Missing Data using the L1 Norm [J].
Eriksson, Anders ;
van den Hengel, Anton .
2010 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2010, :771-778
[9]   Structured and weighted multi-task low rank tracker [J].
Fan, Baojie ;
Li, Xiaomao ;
Cong, Yang ;
Tang, Yandong .
PATTERN RECOGNITION, 2018, 81 :528-544
[10]  
Feng Lin, 2011, NAECON 2011 - IEEE National Aerospace and Electronics Conference, P324, DOI 10.1109/NAECON.2011.6183125