Xiaoning Kang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiaoning Kang has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
Mingqiu Wang
School of Statistics and Data Science Qufu Normal University Qufu Shandong China
4 shared publications- Xinwei Deng
Department of Statistics, Virginia Tech, Blacksburg, USA
4 shared publications Chaoping Xie
College of Economics and Management Nanjing Agricultural University Nanjing China
2 shared publications- Ran Jin
Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA, USA
2 shared publications Wenyu Yang
College of Science, Huazhong Agricultural University, Wuhan, China
2 shared publications- Xiaoyu Chen
Department of Industrial and Systems Engineering, State University of New York at Buffalo, Buffalo, New York 14260
2 shared publications
Latest Publications
- Open Access
- 3 April 2026
- Published by Taylor & Francis in Statistical Theory and Related Fields
- Vol. 10 (2) , 268-284
A new anomaly detection via multiple instance learning for sequence data with application to credit card delinquency risk control
1. In recent years, research on anomaly detection of sequence data has gradually become a hot topic. It has a very wide range of applications in many scientific fields. Especially in the financial ...
- 3 April 2026
- Published by Taylor & Francis in Statistical Theory and Related Fields
- Vol. 10 (2) , 268-284
Open AccessA new anomaly detection via multiple instance learning for sequence data with application to credit card delinquency risk control
1. In recent years, research on anomaly detection of sequence data has gradually become a hot topic. It has a very wide range of applications in many scientific fields. Especially in the financial ...
Sparse Minimum Distance Kernel Estimation for High‐Dimensional Linear Models
In recent years, the rapid advancement of data collection and processing technologies has led to a growing influx of high‐dimensional data into various scientific fields. However, this surge in data is often accompanied by the frequent occurrence of outliers, particularly in domains such as genomic and image data. If these outliers are not appropriately addressed, they can result in biased or invalid models that may mislead subsequent statistical inference based on the data. Building upon the minimum distance and kernel density estimator, this paper thus proposes a new method named minimum distance kernel estimation (MDKE) to overcome the problems caused by the outliers in data. We construct the objective function of MDKE by employing the kernel technique. The advantage of MDKE over existing approaches is that it is robust to both outliers and high‐leverage points and does not rely on a prespecified parametric form for the error distribution. Furthermore, the sparse MDKE (SMDKE) is proposed for high‐dimensional data by inducing the regularizations such as LASSO, SCAD and MCP. The extensive simulation studies are conducted, demonstrating that MDKE exhibits superior robustness than the existing methods for data with outliers in both the response and covariates. Analyses of real‐world datasets involving plasma beta‐carotene levels and microarray gene expression further demonstrate the superior robustness and variable selection performance of the proposed SMDKE method compared to existing alternatives.
Sparse Minimum Distance Kernel Estimation for High‐Dimensional Linear Models
In recent years, the rapid advancement of data collection and processing technologies has led to a growing influx of high‐dimensional data into various scientific fields. However, this surge in data is often accompanied by the frequent occurrence of outliers, particularly in domains such as genomic and image data. If these outliers are not appropriately addressed, they can result in biased or invalid models that may mislead subsequent statistical inference based on the data. Building upon the minimum distance and kernel density estimator, this paper thus proposes a new method named minimum distance kernel estimation (MDKE) to overcome the problems caused by the outliers in data. We construct the objective function of MDKE by employing the kernel technique. The advantage of MDKE over existing approaches is that it is robust to both outliers and high‐leverage points and does not rely on a prespecified parametric form for the error distribution. Furthermore, the sparse MDKE (SMDKE) is proposed for high‐dimensional data by inducing the regularizations such as LASSO, SCAD and MCP. The extensive simulation studies are conducted, demonstrating that MDKE exhibits superior robustness than the existing methods for data with outliers in both the response and covariates. Analyses of real‐world datasets involving plasma beta‐carotene levels and microarray gene expression further demonstrate the superior robustness and variable selection performance of the proposed SMDKE method compared to existing alternatives.
- 5 August 2023
- Published by Taylor & Francis in Journal of Statistical Computation and Simulation
- Vol. 94 (2) , 297-314
Heteroscedasticity identification and variable selection via multiple quantile regression
- 5 August 2023
- Published by Taylor & Francis in Journal of Statistical Computation and Simulation
- Vol. 94 (2) , 297-314
Heteroscedasticity identification and variable selection via multiple quantile regression
- 26 July 2023
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 188
Ensemble LDA via the modified Cholesky decomposition
- 26 July 2023
- Published by Elsevier in Computational Statistics & Data Analysis
- Vol. 188
Ensemble LDA via the modified Cholesky decomposition
- 24 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 70 (8) , 3114-3118
Enhance the Hidden Structure of Deep Neural Networks by Double Laplacian Regularization
The Laplacian regularization has been widely used in neural networks due to its ability to improve generalization performance, which enforces adjacent samples with the same labels to share similar features. However, most existing methods only consider the global structure of the data with the same labels, but neglect samples in boundary areas with different labels. To address this limitation and improve performance, this paper proposes a novel regularization method that enhances the hidden structure of deep neural networks. Our proposed method imposes a double Laplacian regularization on the objective function and leverages full data information to capture its hidden structure in the manifold space. The double Laplacian regularization applies both attraction and repulsion effects on the hidden layer, which encourages the hidden features of instances with the same label to be closer, and forces those of different categories to be further away.Extensive experiments demonstrate the proposed method leads to significant improvements in accuracy on different types of deep neural networks.
- 24 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 70 (8) , 3114-3118
Enhance the Hidden Structure of Deep Neural Networks by Double Laplacian Regularization
The Laplacian regularization has been widely used in neural networks due to its ability to improve generalization performance, which enforces adjacent samples with the same labels to share similar features. However, most existing methods only consider the global structure of the data with the same labels, but neglect samples in boundary areas with different labels. To address this limitation and improve performance, this paper proposes a novel regularization method that enhances the hidden structure of deep neural networks. Our proposed method imposes a double Laplacian regularization on the objective function and leverages full data information to capture its hidden structure in the manifold space. The double Laplacian regularization applies both attraction and repulsion effects on the hidden layer, which encourages the hidden features of instances with the same label to be closer, and forces those of different categories to be further away.Extensive experiments demonstrate the proposed method leads to significant improvements in accuracy on different types of deep neural networks.
- 16 March 2023
- Published by Taylor & Francis in Journal of Biopharmaceutical Statistics
- Vol. 36 (5) , 717-731
Improved confidence estimation for the binomial proportion with applications to clinical studies
- 16 March 2023
- Published by Taylor & Francis in Journal of Biopharmaceutical Statistics
- Vol. 36 (5) , 717-731
Improved confidence estimation for the binomial proportion with applications to clinical studies
- 23 December 2022
- Published by Wiley in Statistics in Medicine
- Vol. 42 (5) , 656-675
A novel robust estimation for high‐dimensional precision matrices
In this paper we propose a new robust estimation of precision matrices for high‐dimensional data when the number of variables is larger than the sample size. Different from the existing methods in literature, the proposed model combines the technique of modified Cholesky decomposition (MCD) with the robust generalized M‐estimators. The MCD reparameterizes a precision matrix and transforms its estimation into solving a series of linear regressions, in which the commonly used robust techniques can be conveniently incorporated. Additionally, the proposed method adopts the model averaging idea to address the ordering issue in the MCD approach, resulting in an accurate estimation for precision matrices. Simulations and real data analysis are conducted to illustrate the merits of the proposed estimator.
- 23 December 2022
- Published by Wiley in Statistics in Medicine
- Vol. 42 (5) , 656-675
A novel robust estimation for high‐dimensional precision matrices
In this paper we propose a new robust estimation of precision matrices for high‐dimensional data when the number of variables is larger than the sample size. Different from the existing methods in literature, the proposed model combines the technique of modified Cholesky decomposition (MCD) with the robust generalized M‐estimators. The MCD reparameterizes a precision matrix and transforms its estimation into solving a series of linear regressions, in which the commonly used robust techniques can be conveniently incorporated. Additionally, the proposed method adopts the model averaging idea to address the ordering issue in the MCD approach, resulting in an accurate estimation for precision matrices. Simulations and real data analysis are conducted to illustrate the merits of the proposed estimator.
- 31 October 2022
- Published by Taylor & Francis in Technometrics
- Vol. 65 (2) , 206-219
Bayesian Sparse Regression for Mixed Multi-Responses with Application to Runtime Metrics Prediction in Fog Manufacturing
Fog manufacturing can greatly enhance traditional manufacturing systems through distributed Fog computation units, which are governed by predictive computational workload offloading methods under different Industrial Internet architectures. It is known that the predictive offloading methods highly depend on accurate prediction and uncertainty quantification of runtime performance metrics, containing multivariate mixed-type responses (i.e., continuous, counting, binary). In this work, we propose a Bayesian sparse regression for multivariate mixed responses to enhance the prediction of runtime performance metrics and to enable the statistical inferences. The proposed method considers both group and individual variable selection to jointly model the mixed types of runtime performance metrics. The conditional dependency among multiple responses is described by a graphical model using the precision matrix, where a spike-and-slab prior is used to enable the sparse estimation of the graph. The proposed method not only achieves accurate prediction, but also makes the predictive model more interpretable with statistical inferences on model parameters and prediction in the Fog manufacturing. A simulation study and a real case example in a Fog manufacturing are conducted to demonstrate the merits of the proposed model.
- 31 October 2022
- Published by Taylor & Francis in Technometrics
- Vol. 65 (2) , 206-219
Bayesian Sparse Regression for Mixed Multi-Responses with Application to Runtime Metrics Prediction in Fog Manufacturing
Fog manufacturing can greatly enhance traditional manufacturing systems through distributed Fog computation units, which are governed by predictive computational workload offloading methods under different Industrial Internet architectures. It is known that the predictive offloading methods highly depend on accurate prediction and uncertainty quantification of runtime performance metrics, containing multivariate mixed-type responses (i.e., continuous, counting, binary). In this work, we propose a Bayesian sparse regression for multivariate mixed responses to enhance the prediction of runtime performance metrics and to enable the statistical inferences. The proposed method considers both group and individual variable selection to jointly model the mixed types of runtime performance metrics. The conditional dependency among multiple responses is described by a graphical model using the precision matrix, where a spike-and-slab prior is used to enable the sparse estimation of the graph. The proposed method not only achieves accurate prediction, but also makes the predictive model more interpretable with statistical inferences on model parameters and prediction in the Fog manufacturing. A simulation study and a real case example in a Fog manufacturing are conducted to demonstrate the merits of the proposed model.
- 20 December 2021
- Published by Wiley in Canadian Journal of Statistics
- Vol. 51 (1) , 38-76
Doubly robust weighted composite quantile regression based on SCAD‐L2
- 20 December 2021
- Published by Wiley in Canadian Journal of Statistics
- Vol. 51 (1) , 38-76
Doubly robust weighted composite quantile regression based on SCAD‐L2
- 29 May 2021
- Published by Taylor & Francis in Journal of Biopharmaceutical Statistics
- Vol. 31 (5) , 603-616
A Cholesky-based sparse covariance estimation with an application to genes data
The modified Cholesky decomposition (MCD) is a powerful tool for estimating a covariance matrix. The regularization can be conveniently imposed on the linear regressions to encourage the sparsity in the estimated covariance matrix to accommodate the high-dimensional data. In this paper, we propose a Cholesky-based sparse ensemble estimate for covariance matrix by averaging a set of Cholesky factor estimates obtained from multiple variable orderings used in the MCD. The sparse estimation is enabled by encouraging the sparsity in the Cholesky factor. The theoretical consistent property is established under some regular conditions. The merits of the proposed method are illustrated through simulation and a maize genes data set.
- 29 May 2021
- Published by Taylor & Francis in Journal of Biopharmaceutical Statistics
- Vol. 31 (5) , 603-616
A Cholesky-based sparse covariance estimation with an application to genes data
The modified Cholesky decomposition (MCD) is a powerful tool for estimating a covariance matrix. The regularization can be conveniently imposed on the linear regressions to encourage the sparsity in the estimated covariance matrix to accommodate the high-dimensional data. In this paper, we propose a Cholesky-based sparse ensemble estimate for covariance matrix by averaging a set of Cholesky factor estimates obtained from multiple variable orderings used in the MCD. The sparse estimation is enabled by encouraging the sparsity in the Cholesky factor. The theoretical consistent property is established under some regular conditions. The merits of the proposed method are illustrated through simulation and a maize genes data set.