Decision Tree and Instance-Based Learning for Label Ranking
published: Aug. 26, 2009, recorded: June 2009, views: 1172
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.
The label ranking problem consists of learning a model that maps instances to total orders over a ﬁnite set of predeﬁned labels. This paper introduces new methods for label ranking that complement and improve upon existing approaches. More speciﬁcally, we propose extensions of two methods that have been used extensively for classiﬁcation and regression so far, namely instance-based learning and decision tree induction. The unifying element of the two methods is a procedure for locally estimating predictive probability models for label rankings.
Download slides: icml09_cheng_dtibllflr_01.pdf (930.6 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !