Article
Version 1
Preserved in Portico This version is not peer-reviewed
Data Censoring with Set-Membership Affine Projection Algorithm
Version 1
: Received: 11 October 2018 / Approved: 12 October 2018 / Online: 12 October 2018 (04:57:08 CEST)
How to cite: Moradi, H. R.; Zardadi, A. Data Censoring with Set-Membership Affine Projection Algorithm. Preprints 2018, 2018100253. https://doi.org/10.20944/preprints201810.0253.v1 Moradi, H. R.; Zardadi, A. Data Censoring with Set-Membership Affine Projection Algorithm. Preprints 2018, 2018100253. https://doi.org/10.20944/preprints201810.0253.v1
Abstract
In this paper, the set-membership affine projection (SM-AP) algorithm is utilized to censor non-informative data in big data applications. To this end, the probability distribution of the additive noise signal and the excess of mean-squared error (EMSE) in steady-state are employed in order to estimate the threshold parameter of the single threshold SM-AP (ST-SM-AP) algorithm aiming at attaining the desired update rate. Furthermore, by defining an acceptable range for the error signal, the double threshold SM-AP (DT-SM-AP) algorithm is proposed to detect very large errors due to the irrelevant data such as outliers. The DT-SM-AP algorithm can censor non-informative and irrelevant data in big data applications, and it can improve misalignment and convergence rate of the learning process with high computational efficiency. The simulation and numerical results corroborate the superiority of the proposed algorithms over traditional algorithms.
Keywords
adaptive filtering; set-membership filtering; affine projection; data censoring; big data; outliers
Subject
Computer Science and Mathematics, Computer Science
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment