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.