模式识别与人工智能
Monday, Apr. 21, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2012, Vol. 25 Issue (5): 721-728    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
L1/2 Regularized Logistic Regression
ZHAO Qian, MENG De-Yu, XU Zong-Ben
Institute for Information and System Sciences,School of Mathematics and Statistics,Xi’an Jiaotong University,Xi’an 710049

Download: PDF (409 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  A Logistic L1/2 regularization model with its efficient solution algorithm is proposed. By the proposed model, which is constructed on the basis of the L1/2 regularization theory, the variable selection capability is enhanced and the over-fitting problem of the traditional model is alleviated. The proposed algorithm with high computational efficiency is designed by the coordinate descent technique. The experimental results on synthetic and real datasets indicate that the proposed method outperforms the traditional Logistic regression and the L1 regularized Logistic regression on both variable selection and tendency prediction.
Key wordsLogistic Regression      L1/2 Regularization      Coordinate Descent Algorithm     
Received: 26 May 2011     
ZTFLH: TP391  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
Cite this article:   
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2012/V25/I5/721
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn