A noise-resilient online learning algorithm with ramp loss for ordinal regression

Author:

Zhang Maojun121,Zhang Cuiqing21,Liang Xijun3,Xia Zhonghang4,Jian Ling5,Nan Jiangxia1

Affiliation:

1. School of Business, Suzhou University of Science and Technology, Suzhou, Jiangsu, China

2. School of Mathematics and Computer Science, Guilin University of Electronic Technology, Guilin, Guangxi, China

3. College of Science, China University of Petroleum, Qingdao, Shandong, China

4. School of Engineering and Applied Science, Western Kentucky University, Bowling Green, KY, USA

5. School of Economics and Management, China University of Petroleum, Qingdao, Shandong, China

Abstract

Ordinal regression has been widely used in applications, such as credit portfolio management, recommendation systems, and ecology, where the core task is to predict the labels on ordinal scales. Due to its learning efficiency, online ordinal regression using passive aggressive (PA) algorithms has gained a much attention for solving large-scale ranking problems. However, the PA method is sensitive to noise especially in the scenario of streaming data, where the ranking of data samples may change dramatically. In this paper, we propose a noise-resilient online learning algorithm using the Ramp loss function, called PA-RAMP, to improve the performance of PA method for noisy data streams. Also, we validate the order preservation of thresholds of the proposed algorithm. Experiments on real-world data sets demonstrate that the proposed noise-resilient online ordinal regression algorithm is more robust and efficient than state-of-the-art online ordinal regression algorithms.

Publisher

IOS Press

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Theoretical Computer Science

Reference23 articles.

1. Corporate credit rating using multiclass classification models with order information;Ahn;Comput. Oper. Res,2011

2. K. Crammer and Y. Singer, Pranking with ranking, Advances in Neural Information Processing Systems 14 (2002), 641–647.

3. E.F. Harrington, Online ranking/collaborative filtering using the perceptron algorithm, in: Proceedings of the Twentieth International Conference on Machine Learning, 2002, pp. 250–257.

4. J.D. Rennie and N. Srebro, Loss functions for preference levels: Regression with discrete ordered labels, in: Proceedings of The IJCAI Multidisciplinary Workshop on Advances in Preference Handling, 2005, pp. 180–186.

5. Ordinal response regression models in ecology;Guisan;Journal of Vegetation Science,2000

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3