Two-dimensional Bhattacharyya bound linear discriminant analysis with its applications.

The recently proposed L2-norm linear discriminant analysis criterion based on Bhattacharyya error bound estimation (L2BLDA) was an effective improvement over linear discriminant analysis (LDA) and was used to handle vector input samples. When faced with two-dimensional (2D) inputs, such as images, converting two-dimensional data to vectors, regardless of the inherent structure of the image, may result in some loss of useful information. In this paper, we propose a novel two-dimensional Bhattacharyya bound linear discriminant analysis (2DBLDA). 2DBLDA maximizes the matrix-based between-class distance, which is measured by the weighted pairwise distances of class means and minimizes the matrix-based within-class distance. The criterion of 2DBLDA is equivalent to optimizing the upper bound of the Bhattacharyya error. The weighting constant between the between-class and within-class terms is determined by the involved data that make the proposed 2DBLDA adaptive. The construction of 2DBLDA avoids the small sample size (SSS) problem, is robust, and can be solved through a simple standard eigenvalue decomposition problem. The experimental results on image recognition and face image reconstruction demonstrate the effectiveness of 2DBLDA.

Generalized two-dimensional linear discriminant analysis with regularization.

Recent advances show that two-dimensional linear discriminant analysis (2DLDA) is a successful matrix based dimensionality reduction method. However, 2DLDA may encounter the singularity issue theoretically, and also is sensitive to outliers. In this paper, a generalized Lp-norm 2DLDA framework with regularization for an arbitrary p>0 is proposed, named G2DLDA. There are mainly two contributions of G2DLDA: one is G2DLDA model uses an arbitrary Lp-norm to measure the between-class and within-class scatter, and hence a proper p can be selected to achieve robustness. The other one is that the introduced regularization term makes G2DLDA enjoy better generalization performance and avoid singularity. In addition, an effective learning algorithm is designed for G2LDA, which can be solved through a series of convex problems with closed-form solutions. Its convergence can be guaranteed theoretically when 1≤p≤2. Preliminary experimental results on three contaminated human face databases show the effectiveness of the proposed G2DLDA.

General Plane-Based Clustering With Distribution Loss.

In this article, we propose a general model for plane-based clustering. The general model reveals the relationship between cluster assignment and cluster updating during clustering implementation, and it contains many existing plane-based clustering methods, e.g., k-plane clustering, proximal plane clustering, twin support vector clustering, and their extensions. Under this general model, one may obtain an appropriate clustering method for a specific purpose. The general model is a procedure corresponding to an optimization problem, which minimizes the total loss of the samples. Thereinto, the loss of a sample derives from both within-cluster and between-cluster information. We discuss the theoretical termination conditions and prove that the general model terminates in a finite number of steps at a local or weak local solution. Furthermore, we propose a distribution loss function that fluctuates with the input data and introduce it into the general model to obtain a plane-based clustering method (DPC). DPC can capture the data distribution precisely because of its statistical characteristics, and its termination that finitely terminates at a weak local solution is given immediately based on the general model. The experimental results show that our DPC outperforms the state-of-the-art plane-based clustering methods on many synthetic and benchmark data sets.

Comparison of clinical characteristics between fecal/perianal swab nucleic acid-positive and -negative patients with COVID-19.

INTRODUCTION: We analyzed the clinical characteristics of COVID-19 fecal/perianal swab nucleic acid-positive patients in our hospital and evaluated the effect of SARS-CoV-2 on the gastrointestinal tract. METHODOLOGY: Ninety-seven patients in the Fifth Affiliated Hospital of Sun Yat-sen University from January 17, 2020 to March 2, 2020 with fecal/perianal swab samples were selected as subjects and the results of real-time fluorescence reverse transcriptase-PCR SARS-CoV-2 nucleic acid detection of fecal/perianal swabs were used to divide subjects into positive and negative groups. RESULTS: Fecal/perianal swabs of 53.61% (52/97) patients were positive including 31 males (59.62%) and 21 females (40.38%). The negative group had more females than males (P = 0.001). The distribution of case classification based on the most severe condition observed after admission was different between groups: five (5.15%) critical type patients were all from the positive group (P = 0.029). There was no statistical difference in clinical manifestations between the groups. In the positive group, the mean nucleic acid-negative conversion time was 14.13 ± 8.61 days, which was significantly later than the negative group (6.98 ± 5.16 days; P < 0.001). In the positive group, 92% (48/52) had nucleic acid-negative conversion with a mean nucleic acid-negative conversion time of 22.58 ± 10.30 days. Among them, 41 (78.85%) cases were delayed compared with pharynx/nasal swab nucleic acid-negative conversion time. CONCLUSIONS: The positive rate of fecal/perianal swab nucleic acid in male patients was higher than that in female patients. Fecal/perianal swab nucleic acid positive may be an indicator of critical conditions in those with COVID-19.

Psychological status and behavior changes of the public during the COVID-19 epidemic in China.

BACKGROUND: A cluster of pneumonia cases were reported by Wuhan Municipal Health Commission, China in December 2019. A novel coronavirus was eventually identified, and became the COVID-19 epidemic that affected public health and life. We investigated the psychological status and behavior changes of the general public in China from January 30 to February 3, 2020. METHODS: Respondents were recruited via social media (WeChat) and completed an online questionnaire. We used the State-Trait Anxiety Inventory, Self-rating Depression Scale, and Symptom Checklist-90 to evaluate psychological status. We also investigated respondents' behavior changes. Quantitative data were analyzed by t-tests or analysis of variance, and classified data were analyzed with chi-square tests. RESULTS: In total, 608 valid questionnaires were obtained. More respondents had state anxiety than trait anxiety (15.8% vs 4.0%). Depression was found among 27.1% of respondents and 7.7% had psychological abnormalities. About 10.1% of respondents suffered from phobia. Our analysis of the relationship between subgroup characteristics and psychological status showed that age, gender, knowledge about COVID-19, degree of worry about epidemiological infection, and confidence about overcoming the outbreak significantly influenced psychological status. Around 93.3% of respondents avoided going to public places and almost all respondents reduced Spring Festival-related activities. At least 70.9% of respondents chose to take three or more preventive measures to avoid infection. The three most commonly used prevention measures were making fewer trips outside and avoiding contact (98.0%), wearing a mask (83.7%), and hand hygiene (82.4%). CONCLUSIONS: We need to pay more attention to public psychological stress, especially among young people, as they are likely to experience anxiety, depression, and psychological abnormalities. Different psychological interventions could be formulated according to the psychological characteristics of different gender and age groups. The majority of respondents followed specific behaviors required by the authorities, but it will take time to observe the effects of these behaviors on the epidemic.

Robust and Sparse Linear Discriminant Analysis via an Alternating Direction Method of Multipliers.

In this paper, we propose a robust linear discriminant analysis (RLDA) through Bhattacharyya error bound optimization. RLDA considers a nonconvex problem with the L1 -norm operation that makes it less sensitive to outliers and noise than the L2 -norm linear discriminant analysis (LDA). In addition, we extend our RLDA to a sparse model (RSLDA). Both RLDA and RSLDA can extract unbounded numbers of features and avoid the small sample size (SSS) problem, and an alternating direction method of multipliers (ADMM) is used to cope with the nonconvexity in the proposed formulations. Compared with the traditional LDA, our RLDA and RSLDA are more robust to outliers and noise, and RSLDA can obtain sparse discriminant directions. These findings are supported by experiments on artificial data sets as well as human face databases.

Robust recursive absolute value inequalities discriminant analysis with sparseness.

In this paper, we propose a novel absolute value inequalities discriminant analysis (AVIDA) criterion for supervised dimensionality reduction. Compared with the conventional linear discriminant analysis (LDA), the main characteristics of our AVIDA are robustness and sparseness. By reformulating the generalized eigenvalue problem in LDA to a related SVM-type "concave-convex" problem based on absolute value inequalities loss, our AVIDA is not only more robust to outliers and noises, but also avoids the SSS problem. Moreover, the additional L1-norm regularization term in the objective makes sure sparse discriminant vectors are obtained. A successive linear algorithm is employed to solve the proposed optimization problem, where a series of linear programs are solved. The superiority of our AVIDA is supported by experimental results on artificial examples as well as benchmark image databases.

Robust L1-norm two-dimensional linear discriminant analysis.

In this paper, we propose an L1-norm two-dimensional linear discriminant analysis (L1-2DLDA) with robust performance. Different from the conventional two-dimensional linear discriminant analysis with L2-norm (L2-2DLDA), where the optimization problem is transferred to a generalized eigenvalue problem, the optimization problem in our L1-2DLDA is solved by a simple justifiable iterative technique, and its convergence is guaranteed. Compared with L2-2DLDA, our L1-2DLDA is more robust to outliers and noises since the L1-norm is used. This is supported by our preliminary experiments on toy example and face datasets, which show the improvement of our L1-2DLDA over L2-2DLDA.