Application of Sparse Representation in Bioinformatics

Inspired by L1-norm minimization methods, such as basis pursuit, compressed sensing, and Lasso feature selection, in recent years, sparse representation shows up as a novel and potent data processing method and displays powerful superiority. Researchers have not only extended the sparse representation of a signal to image presentation, but also applied the sparsity of vectors to that of matrices. Moreover, sparse representation has been applied to pattern recognition with good results. Because of its multiple advantages, such as insensitivity to noise, strong robustness, less sensitivity to selected features, and no “overfitting” phenomenon, the application of sparse representation in bioinformatics should be studied further. This article reviews the development of sparse representation, and explains its applications in bioinformatics, namely the use of low-rank representation matrices to identify and study cancer molecules, low-rank sparse representations to analyze and process gene expression profiles, and an introduction to related cancers and gene expression profile database.

Missing Data Reconstruction Based on Spectral k-Support Norm Minimization for NB-IoT Data

An effective fraction of data with missing values from various physiochemical sensors in the Internet of Things is still emerging owing to unreliable links and accidental damage. This phenomenon will limit the predicative ability and performance for supporting data analyses by IoT-based platforms. Therefore, it is necessary to exploit a way to reconstruct these lost data with high accuracy. A new data reconstruction method based on spectral k-support norm minimization (DR-SKSNM) is proposed for NB-IoT data, and a relative density-based clustering algorithm is embedded into model processing for improving the accuracy of reconstruction. First, sensors are grouped by similar patterns of measurement. A relative density-based clustering, which can effectively identify clusters in data sets with different densities, is applied to separate sensors into different groups. Second, based on the correlations of sensor data and its joint low rank, an algorithm based on the matrix spectral k-support norm minimization with automatic weight is developed. Moreover, the alternating direction method of multipliers (ADMM) is used to obtain its optimal solution. Finally, the proposed method is evaluated by using two simulated and real sensor data sources from Panzhihua environmental monitoring station with random missing patterns and consecutive missing patterns. From the simulation results, it is proved that our algorithm performs well, and it can propagate through low-rank characteristics to estimate a large missing region’s value.

ℒp-Norm-like Affine Projection Sign Algorithm for Sparse System to Ensure Robustness against Impulsive Noise

An improved affine projection sign algorithm (APSA) was developed herein using a ℒp-norm-like constraint to increase the convergence rate in sparse systems. The proposed APSA is robust against impulsive noise because APSA-type algorithms are generally based on the ℒ1-norm minimization of error signals. Moreover, the proposed algorithm can enhance the filter performance in terms of the convergence rate due to the implementation of the ℒp-norm-like constraint in sparse systems. Since a novel cost function of the proposed APSA was designed for maintaining the similar form of the original APSA, these have symmetric properties. According to the simulation results, the proposed APSA effectively enhances the filter performance in terms of the convergence rate of sparse system identification in the presence of impulsive noises compared to that achieved using the existing APSA-type algorithms.

Robust Localization in Distributed MIMO Radar Using Delay and Angle Measurements with Impulsive Noise Robust TD/AOA Localization in Impulsive Noise

This paper considers target localization using time delay (TD) and angle of arrival (AOA) measurements in distributed multiple-input multiple-output (MIMO) radar. Aiming at the problem that the localization performance of existing algorithms degrades sharply in the presence of impulsive noise, we propose a novel localization algorithm based on ℓ p -norm minimization and iteratively reweighted least squares (IRLS). Firstly, the TD and AOA measurement equations are established in the presence of zero-mean symmetric α-stable noise; then, the localization problem is transformed to a ℓ p -norm minimization problem by linearizing the measurement equations; and finally, the ℓ p -norm minimization problem is solved using IRLS by which the target position estimate is obtained, and the optimal choice of norm order p is deduced. Moreover, the Cramér–Rao bound (CRB) for target position estimation in impulsive noise is also derived, generalizing the Gaussian CRB. Simulation results demonstrate that the proposed algorithm outperforms existing algorithms in terms of localization accuracy and robustness in impulsive noise.