TY - GEN
T1 - Learning to rank relational objects based on the listwise approach
AU - Ding, Yuxin
AU - Zhou, Di
AU - Xiao, Min
AU - Dong, Li
PY - 2011
Y1 - 2011
N2 - In recent years machine learning technologies have been applied to ranking, and a new research branch named "learning to rank" has emerged. Three types of learning-to-rank methods - pointwise, pairwise and listwise approaches - have been proposed. This paper is concerned with listwise approach. Currently structural support vector machine(SVM) and linear neural network have been utilized in listwise approach, but these methods only consider the content relevance of an object with respect to queries, they all ignore the relationships between objects. In this paper we study how to use relationships between objects to improve the performance of a ranking model. A novel ranking function is proposed, which combines the content relevance of documents with respect to queries and relation information between documents. Two types of loss functions are constructed as the targets for optimization. Then we utilize neural network and gradient descent algorithm as model and training algorithm to build ranking model. In the experiments, we compare the proposed methods with two conventional listwise approaches. Experimental results on OHSUMED dataset show that the proposed methods outperform the conventional methods.
AB - In recent years machine learning technologies have been applied to ranking, and a new research branch named "learning to rank" has emerged. Three types of learning-to-rank methods - pointwise, pairwise and listwise approaches - have been proposed. This paper is concerned with listwise approach. Currently structural support vector machine(SVM) and linear neural network have been utilized in listwise approach, but these methods only consider the content relevance of an object with respect to queries, they all ignore the relationships between objects. In this paper we study how to use relationships between objects to improve the performance of a ranking model. A novel ranking function is proposed, which combines the content relevance of documents with respect to queries and relation information between documents. Two types of loss functions are constructed as the targets for optimization. Then we utilize neural network and gradient descent algorithm as model and training algorithm to build ranking model. In the experiments, we compare the proposed methods with two conventional listwise approaches. Experimental results on OHSUMED dataset show that the proposed methods outperform the conventional methods.
UR - https://www.scopus.com/pages/publications/80054753553
U2 - 10.1109/IJCNN.2011.6033445
DO - 10.1109/IJCNN.2011.6033445
M3 - 会议稿件
AN - SCOPUS:80054753553
SN - 9781457710865
T3 - Proceedings of the International Joint Conference on Neural Networks
SP - 1818
EP - 1824
BT - 2011 International Joint Conference on Neural Networks, IJCNN 2011 - Final Program
T2 - 2011 International Joint Conference on Neural Network, IJCNN 2011
Y2 - 31 July 2011 through 5 August 2011
ER -