Lingxiao Qu

Dr. Lingxiao Qu

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 July 2024 in Processes
Verified
Journal Article
Open access
PDF file
LQLingxiao Qu
Lingxiao Qu
Yan PeiYan Pei
Yan Pei
The classical linear discriminant analysis (LDA) algorithm has three primary drawbacks, i.e., small sample size problem, sensitivity to noise and outliers, and inability to deal with multi-modal-class data. This paper reviews LDA technology and its variants, covering the taxonomy and characteristics of these technologies and comparing their innovations and developments in addressing these three shortcomings. Additionally, we describe the application areas and emphasize the kernel extensions of these technologies to solve nonlinear problems. Most importantly, this paper presents perspectives on future research directions and potential research areas in this field.

10 December 2020 in IEEE Access
Verified
Journal Article
Open access
JJJing Jiang
Jing Jiang
LQLingxiao Qu
Lingxiao Qu
Li et al. introduced coded distributed computing (CDC) scheme to reduce the communication load in general distributed computing frameworks such as MapReduce. They also proposed cascaded CDC schemes where each output function is computed multiple times, and proved that such schemes achieved the fundamental trade-off between computation load and communication load. However, these schemes require exponentially large numbers of input files and output functions when the number of computing nodes gets large. In this paper, by using the structure of placement delivery arrays (PDAs), we construct several infinite classes of cascaded CDC schemes. We also show that the numbers of output functions in all the new schemes are only a factor of the number of computing nodes, and the number of input files in our new schemes is much smaller than that of input files in CDC schemes derived by Li et al.

28 August 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
LQLingxiao Qu
Lingxiao Qu
Yan PeiYan Pei
Yan Pei
The small-sample-size (SSS) problem remains a fundamental challenge in machine learning when labeled data are scarce due to cost, accessibility, or ethical constraints. While numerous approaches have been proposed, existing methods often struggle to maintain stable and discriminative representations under high-dimensional and limited-data conditions. Kernelized Linear Principal Component Discriminant Analysis (KLPCDA), a recently proposed modular framework, integrates variance preservation, inter-class separability, and intra-class compactness within a unified kernel space. Although its formulation has shown promising initial results, a systematic understanding of how its components interact across diverse SSS scenarios remains lacking. In this paper, we present a systematic cross-domain study of KLPCDA to characterize the interaction mechanisms among its core objectives. We analyze the behavior of its seven variants across multiple real-world SSS tasks, including hyperspectral image classification, mechanical fault diagnosis, medical diagnosis, and face recognition. Through extensive experiments and ablation studies, we investigate how different objective combinations influence performance under varying conditions such as noise, class imbalance, and high dimensionality. Our analysis reveals consistent patterns in the interaction of the three core objectives variance, between-class, and within-class terms, providing a unified and interpretable understanding of their roles in stabilizing representations and enhancing discrimination in SSS settings. Based on these findings, we further derive practical guidelines for selecting appropriate KLPCDA variants under different data characteristics. Experimental results demonstrate that KLPCDA achieves strong and robust performance across domains, while maintaining low computational complexity suitable for resource-constrained environments.

7 January 2026 in Neural Networks
Verified
Journal Article
Closed access
LQLingxiao Qu
Lingxiao Qu
Yan PeiYan Pei
Yan Pei