Large-Margin Thresholded Ensembles for Ordinal Regression
published: Feb. 25, 2007, recorded: July 2006, views: 335
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
We propose a thresholded ensemble model for ordinal regression problems. The model consists of a weighted ensemble of confidence functions and an ordered vector of thresholds. Using such a model, we could theoretically and algorithmically reduce ordinal regression problems to binary classification problems in the area of ensemble learning. Based on the reduction, we derive novel large-margin bounds of common error functions, such as the classification error and the absolute error. In addition, we also design two novel boosting approaches for constructing thresholded ensembles. Both our approaches have comparable performance to the state-of-the-art algorithms, but enjoy the benefit of faster training. Experimental results on benchmark datasets demonstrate the usefulness of our boosting approaches.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !