A Simple and Effective Approach Based on a Multi-Level Feature Selection for Automated Parkinson’s Disease Detection

Parkinson’s disease (PD), which is a slowly progressing neurodegenerative disorder, negatively affects people’s daily lives. Early diagnosis is of great importance to minimize the effects of PD. One of the most important symptoms in the early diagnosis of PD disease is the monotony and distortion of speech. Artificial intelligence-based approaches can help specialists and physicians to automatically detect these disorders. In this study, a new and powerful approach based on multi-level feature selection was proposed to detect PD from features containing voice recordings of already-diagnosed cases. At the first level, feature selection was performed with the Chi-square and L1-Norm SVM algorithms (CLS). Then, the features that were extracted from these algorithms were combined to increase the representation power of the samples. At the last level, those samples that were highly distinctive from the combined feature set were selected with feature importance weights using the ReliefF algorithm. In the classification stage, popular classifiers such as KNN, SVM, and DT were used for machine learning, and the best performance was achieved with the KNN classifier. Moreover, the hyperparameters of the KNN classifier were selected with the Bayesian optimization algorithm, and the performance of the proposed approach was further improved. The proposed approach was evaluated using a 10-fold cross-validation technique on a dataset containing PD and normal classes, and a classification accuracy of 95.4% was achieved.

Coherence Trapping in Open Two-Qubit Dynamics

In this manuscript, we examine the dynamical behavior of the coherence in open quantum systems using the l1 norm. We consider a two-qubit system that evolves in the framework of Kossakowski-type quantum dynamical semigroups (KTQDSs) of completely positive maps (CPMs). We find that the quantum coherence can be asymptotically maintained with respect to the values of the system parameters. Moreover, we show that the quantum coherence can resist the effect of the environment and preserve even in the regime of long times. The obtained results also show that the initially separable states can provide a finite value of the coherence during the time evolution. Because of such properties, several states in this type of environments are good candidates for incorporating quantum information and optics (QIO) schemes. Finally, we compare the dynamical behavior of the coherence with the entire quantum correlation.

Deblending based on the frequency-structure weighted threshold: The case of the slope-constrained f-k transform

In the process of separating blended data, conventional methods based on sparse inversion assume that the primary source is coherent and the secondary source is randomized. The L1-norm, the commonly used regularization term, uses a global threshold to process the sparse spectrum in the transform domain; however, when the threshold is relatively high, more high-frequency information from the primary source will be lost. For this reason, we analyze the generation principle of blended data based on the convolution theory and then conclude that the blended data is only randomly distributed in the spatial domain. Taking the slope-constrained frequency-wavenumber ( f- k) transform as an example, we propose a frequency-dependent threshold, which reduces the high-frequency loss during the deblending process. Then we propose to use a structure weighted threshold in which the energy from the primary source is concentrated along the wavenumber direction. The combination of frequency and structure-weighted thresholds effectively improves the deblending performance. Model and field data show that the proposed frequency-structure weighted threshold has better frequency preservation than the global threshold. The weighted threshold can better retain the high-frequency information of the primary source, and the similarity between other frequency-band data and the unblended data has been improved.

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.

Change Point Detection Using Penalized Multidegree Splines

We consider a function estimation method with change point detection using truncated power spline basis and elastic-net-type L1-norm penalty. The L1-norm penalty controls the jump detection and smoothness depending on the value of the parameter. In terms of the proposed estimators, we introduce two computational algorithms for the Lagrangian dual problem (coordinate descent algorithm) and constrained convex optimization problem (an algorithm based on quadratic programming). Subsequently, we investigate the relationship between the two algorithms and compare them. Using both simulation and real data analysis, numerical studies are conducted to validate the performance of the proposed method.

Block-Sparse Recovery with Optimal Block Partition

This paper presents a convex recovery method for block-sparse signals whose block partitions are unknown a priori. We first introduce a nonconvex penalty function, where the block partition is adapted for the signal of interest by minimizing the mixed l2/l1 norm over all possible block partitions. Then, by exploiting a variational representation of the l2 norm, we derive the proposed penalty function as a suitable convex relaxation of the nonconvex one. For a block-sparse recovery model designed with the proposed penalty, we develop an iterative algorithm which is guaranteed to converge to a globally optimal solution. Numerical experiments demonstrate the effectiveness of the proposed method.