Date of Original Version

4-2009

Type

Conference Proceeding

Published In

M. Boughanem et al. (Eds.): ECIR 2009, LNCS 5478, pp. 78–89, 2009.

Abstract or Description

Learning ranking functions is crucial for solving many problems, ranging from document retrieval to building recommendation systems based on an individual user’s preferences or on collaborative filtering. Learning-to-rank is particularly necessary for adaptive or personalizable tasks, including email prioritization, individualized recommendation systems, personalized news clipping services and so on. Whereas the learning-to-rank challenge has been addressed in the literature, little work has been done in an active-learning framework, where requisite user feedback is minimized by selecting only the most informative instances to train the rank learner. This paper addresses active rank-learning head on, proposing a new sampling strategy based on minimizing hinge rank loss, and demonstrating the effectiveness of the active sampling method for rankSVM on two standard rank-learning datasets. The proposed method shows convincing results in optimizing three performance metrics, as well as improvement against four baselines including entropbased, divergence-based, uncertainty-based and random sampling methods.

DOI

10.1007/978-3-642-00958-7_10

Share

COinS