Ling Zhen
China Agricultural University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Ling Zhen.
Neural Computing and Applications | 2013
Junyan Tan; Zhiqiang Zhang; Ling Zhen; Chunhua Zhang; Nai-Yang Deng
This paper focuses on feature selection in classification. A new version of support vector machine (SVM) named p-norm support vector machine (
Applied Intelligence | 2014
Zhiqiang Zhang; Ling Zhen; Nai-Yang Deng; Junyan Tan
SpringerPlus | 2016
Qiuling Hou; Meng Lv; Ling Zhen; Ling Jing
p\in[0,1]
Neurocomputing | 2016
Qiuling Hou; Ling Zhen; Nai-Yang Deng; Ling Jing
Neural Computing and Applications | 2015
Zhiqiang Zhang; Ling Zhen; Nai-Yang Deng; Junyan Tan
) is proposed. Different from the standard SVM, the p-norm
Neurocomputing | 2014
Junyan Tan; Ling Zhen; Nai-Yang Deng; Zhiqiang Zhang
International Journal of Remote Sensing | 2018
Weibao Du; Wenwen Qiang; Meng Lv; Qiuling Hou; Ling Zhen; Ling Jing
(p\in[0,1])
International Journal of Machine Learning and Cybernetics | 2018
Jinxin Zhang; Qiuling Hou; Ling Zhen; Ling Jing
Engineering Applications of Artificial Intelligence | 2018
Qiuling Hou; Liming Liu; Ling Zhen; Ling Jing
of the normal vector of the decision plane is used which leads to more sparse solution. Our new model can not only select less features but also improve the classification accuracy by adjusting the parameter p. The numerical experiments results show that our p-norm SVM is more effective than some usual methods in feature selection.
11th International Symposium on Operations Research and its Applications in Engineering, Technology and Management 2013 (ISORA 2013) | 2013
Junyan Tan; Ling Zhen; Nai-Yang Deng; Chunhua Zhang
By promoting the parallel hyperplanes to non-parallel ones in SVM, twin support vector machines (TWSVM) have attracted more attention. There are many modifications of them. However, most of the modifications minimize the loss function subject to the I2-norm or I1-norm penalty. These methods are non-adaptive since their penalty forms are fixed and pre-determined for any types of data. To overcome the above shortcoming, we propose lp norm least square twin support vector machine (lpLSTSVM). Our new model is an adaptive learning procedure with lp-norm (0<p<1), where p is viewed as an adjustable parameter and can be automatically chosen by data. By adjusting the parameter p, lpLSTSVM can not only select relevant features but also improve the classification accuracy. The solutions of the optimization problems in lpLSTSVM are obtained by solving a series systems of linear equations (LEs) and the lower bounds of the solution is established which is extremely helpful for feature selection. Experiments carried out on several standard UCI data sets and synthetic data sets show the feasibility and effectiveness of the proposed method.