模式识别与人工智能
Wednesday, Apr. 2, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2013, Vol. 26 Issue (4): 366-373    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Stochastic Optimization Based Fast Learning Method on Large-Scale Noisy Datasets
WANG Jia-Bao
College of Command Information Systems,PLA University of Science and Technology,Nanjing 210007

Download: PDF (698 KB)   HTML (0 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  Aiming at large-scale machine learning problems with noise and interference data,the non-convex Ramp loss function is adopted to suppress the influences of noise and interference data,and a fast learning method is proposed for solving the non-convex linear support vector machines based on stochastic optimization. It effectively improves the training speed and the prediction accuracy. The experimental results manifest that the proposed method greatly reduces the learning time,and on the MNIST dataset the training time is reduced by 4 orders of magnitude compared to the traditional learning method. Meanwhile,it improves the prediction speed in a sense and greatly enhances the generalization performance of the classifiers for noisy dataset.
Received: 21 May 2012     
ZTFLH: TP181  
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/Y2013/V26/I4/366
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