This paper presents a novel method for generally adapting ordinal classification models. We essentially rely on the assumption that the ordinal structure of the set of class labels is also reflected in the topology of the instance space. Under this assumption, this paper proposes an algorithm in two phases that takes advantage of the ordinal structure of the dataset and tries to translate this ordinal structure in the total ordered real line and then to rank the patterns of the dataset. The first phase makes a projection of the ordinal structure of the feature space. Next, an evolutionary algorithm tunes the first projection working with the misclassified patterns near the border of their right class. The results obtained in seven ordinal datasets are competitive in comparison with state-of-the-art algorithms in ordinal regression, but with much less computational time in datasets with many patterns. © 2012 Springer-Verlag.
CITATION STYLE
Becerra-Alonso, D., Carbonero-Ruz, M., Martínez-Estudillo, F. J., & Martínez-Estudillo, A. C. (2012). Evolutionary extreme learning machine for ordinal regression. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7665 LNCS, pp. 217–227). https://doi.org/10.1007/978-3-642-34487-9_27
Mendeley helps you to discover research relevant for your work.