Title
Graph-Based Approaches for Over-Sampling in the Context of Ordinal Regression
Abstract
The classification of patterns into naturally ordered labels is referred to as ordinal regression or ordinal classification. Usually, this classification setting is by nature highly imbalanced, because there are classes in the problem that are a priori more probable than others. Although standard over-sampling methods can improve the classification of minority classes in ordinal classification, they tend to introduce severe errors in terms of the ordinal label scale, given that they do not take the ordering into account. A specific ordinal over-sampling method is developed in this paper for the first time in order to improve the performance of machine learning classifiers. The method proposed includes ordinal information by approaching over-sampling from a graph-based perspective. The results presented in this paper show the good synergy of a popular ordinal regression method (a reformulation of support vector machines) with the graph-based proposed algorithms, and the possibility of improving both the classification and the ordering of minority classes. A cost-sensitive version of the ordinal regression method is also introduced and compared with the over-sampling proposals, showing in general lower performance for minority classes.
Year
DOI
Venue
2015
10.1109/TKDE.2014.2365780
Knowledge and Data Engineering, IEEE Transactions  
Keywords
Field
DocType
Over-sampling,imbalanced classification,ordinal regression,ordinal classification
Data mining,Oversampling,Ordinal number,Computer science,Support vector machine,Ordinal data,A priori and a posteriori,Ordinal regression,Artificial intelligence,Ordinal data type,Ordinal optimization,Machine learning
Journal
Volume
Issue
ISSN
27
5
1041-4347
Citations 
PageRank 
References 
17
0.63
28
Authors
4
Name
Order
Citations
PageRank
María Pérez-Ortiz1173.00
Pedro Antonio Gutiérrez243347.30
César Hervás-Martínez379678.92
Xin Yao414858945.63