Chun-Na Li

Chun-Na Li

Auto-generated profile, based on publicly available information

Chun-Na Li

School of Mathematics and Statistics, Hainan University, Haikou, China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 March 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
CLChun-Na Li
Chun-Na Li
YSYuan-Hai Shao
Yuan-Hai Shao
WYWotao Yin
Wotao Yin
MLMing-Zeng Liu
Ming-Zeng Liu
In this paper, we propose a robust linear discriminant analysis (RLDA) through Bhattacharyya error bound optimization. RLDA considers a nonconvex problem with the L₁-norm operation that makes it less sensitive to outliers and noise than the L₂-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.

1 June 2020 in Applied Mathematical Modelling
Verified
Journal Article
Closed access
YYYafen Ye
Yafen Ye
JGJunbin Gao
Junbin Gao
YSYuanhai Shao
Yuanhai Shao
CLChunna Li
Chunna Li
YJYan Jin
Yan Jin
XHXiangyu Hua
Xiangyu Hua

10 July 2015 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
ZYZhi-Min Yang
Zhi-Min Yang
HWHe-Ji Wu
He-Ji Wu
CLChun-Na Li
Chun-Na Li
YSYuan-Hai Shao
Yuan-Hai Shao

1 October 2019 in Information Sciences
Verified
Journal Article
Closed access
CLChun-Na Li
Chun-Na Li
YSYuan-Hai Shao
Yuan-Hai Shao
ZWZhen Wang
Zhen Wang
NDNai-Yang Deng
Nai-Yang Deng

3 April 2018 in IEEE Access
Verified
Journal Article
Open access
XSXiao-Quan Sun
Xiao-Quan Sun
YCYi-Jian Chen
Yi-Jian Chen
YSYuan-Hai Shao
Yuan-Hai Shao
CLChun-Na Li
Chun-Na Li
CWChanghui Wang
Changhui Wang
As a useful classification method, generalized eigenvalue proximal support vector machine (GEPSVM) is recently studied extensively. However, it may suffer from the sensitivity to outliers, since the L2-norm is used as a measure distance. In this paper, based on the robustness of the L1-norm, we propose an improved robust L1-norm nonparallel proximal SVM with an arbitrary Lp-norm regularization (LpNPSVM), where p > 0. Compared with GEPSVM, the LpNPSVM is more robust to outliers and noise. A simple but effective iterative technique is introduced to solve the LpNPSVM, and its convergence guarantee is also given when 0 <; p ≤ 2. Experimental results on different types of contaminated data sets show the effectiveness of LpNPSVM. At last, we investigate our LpNPSVM on a real spare parts inspection problem. Computational results demonstrate the effectiveness of the proposed method over the GEPSVM on all the noise data.

2 September 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
ZWZhen Wang
Zhen Wang
YSYuan-Hai Shao
Yuan-Hai Shao
LBLan Bai
Lan Bai
CLChun-Na Li
Chun-Na Li
LLLiming LIU
Liming LIU
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.