Papers › oAdaBoost: An AdaBoost Variant for Ordinal Classification
oAdaBoost: An AdaBoost Variant for Ordinal Classification
Joao Costa, Jaime S. Cardoso
Ordinal data classification (ODC) has a wide range of applications in areas where human evaluation plays an important role, ranging from psychology and medicine to information retrieval. In ODC the output variable has a natural order; however, there is not a precise notion of the distance between classes. The Data Replication Method was proposed as tool for solving the ODC problem using a single binary classifier. Due to its characteristics, the Data Replication Method is straightforwardly mapped into methods that optimize the decision function globally. However, the mapping process is not applicable when the methods construct the decision function locally and iteratively, like decision trees and AdaBoost (with decision stumps). In this paper we adapt the Data Replication Method for AdaBoost, by softening the constraints resulting from the data replication process. Experimental comparison with state-of-the-art AdaBoost variants in synthetic and real data show the advantages of our proposal.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections