Name
Abstract | ||
|---|---|---|
Learning to rank is an important task for many data mining applications. Essentially, the goal of learning to rank is to learn an appropriate similarity or distance metric to determine the relevance relationships among data points. However, most of the existing approaches for distance metric learning are limited in three aspects. First, they often assume a fixed form of distance metric for the entire input space. Second, the assumed distance functions are often computationally expensive or even intractable to learn for high dimensional data, such as Mahalanobis distance. Third, most of these approaches lack robustness to noisily labeled data, which is pervasive in many real-world applications. In this paper, we study learning to rank as a problem of distance metric learning to address the above three problems. We choose Bregman distance as the target distance function, due to its general functional form as a generalization of a wide class of distance functions, and its capacity of exploiting complicated nonlinear patterns underlying the data. Under the framework of structural SVM, we formulate the problem of learning Bregman distance functions for ranking as a QP problem by a nonparametric approach, and present an effective algorithm. Furthermore, we propose a self-reinforcement scheme that adaptively differentiates each data point in the role of learning to secure the robustness. We emphasize that the proposed method SBLR-S (Structural Bregman distance functions Learning to Rank with Self-reinforcement) is more general than the conventional distance metric learning approaches, and is able to handle high dimensional data as well as noisily labeled data. The experiments of data ranking on real-world datasets show the superiority of this method to the state-of-the-art literature. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ICDM.2014.15 | ICDM |
Keywords | Field | DocType |
structural bregman distance functions learning to rank with self-reinforcement method,bregman distance function learning problem,self-reinforcement scheme,learning (artificial intelligence),nonparametric approach,structural learning,distance metric learning,complicated nonlinear patterns,bregman distance,distance metric learning approach,nonparametric statistics,mahalanobis distance,structural svm,sblr-s method,structural bregman distance function learning,qp problem,data points,data mining,generalisation (artificial intelligence),self-reinforcement,distance functions,learning to rank,data mining applications,support vector machines,kernel,robustness,optimization,data models,measurement | Learning to rank,Clustering high-dimensional data,Semi-supervised learning,Active learning (machine learning),Computer science,Support vector machine,Metric (mathematics),Mahalanobis distance,Artificial intelligence,Bregman divergence,Machine learning | Conference |
ISSN | Citations | PageRank |
1550-4786 | 1 | 0.35 |
References | Authors | |
28 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Te Pi | 1 | 6 | 1.41 |
| Xi Li | 2 | 1850 | 137.71 |
| Zhongfei (Mark) Zhang | 3 | 2451 | 164.30 |