Machine Learning Methods for Ranking

被引:15
作者
Rahangdale, Ashwini [1 ]
Raut, Shital [1 ]
机构
[1] Visvesvaraya Natl Inst Technol, Dept Comp Sci & Engn, Nagpur 440010, Maharashtra, India
关键词
Learning-to-rank; machine learning; supervised learning; artificial intelligence; SEMI-SUPERVISED RANKING; WEB SEARCH ENGINE; QUERY;
D O I
10.1142/S021819401930001X
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Learning-to-rank is one of the learning frameworks in machine learning and it aims to organize the objects in a particular order according to their preference, relevance or ranking. In this paper, we give a comprehensive survey for learning-to-rank. First, we discuss the different approaches along with different machine learning methods such as regression, SVM, neural network-based, evolutionary, boosting method. In order to compare different approaches: we discuss the characteristics of each approach. In addition to that, learning-to-rank algorithms combine with other machine learning paradigms such as semi-supervised learning, active learning, reinforcement learning and deep learning. The learning-to-rank models employ with parallel or big data analytics to review computational and storage advantage. Many real-time applications use learning-to-rank for preference learning. In regard to this, we introduce some representative works. Finally, we highlighted future directions to investigate learning-to-rank methods.
引用
收藏
页码:729 / 761
页数:33
相关论文
共 100 条
  • [1] Agarwal S., 2009, P 8 ANN INT C COMP S
  • [2] Amini Massih-Reza., 2008, Proceedings_of_the_31st_Annual_International_ ACM_SIGIR_Conference_on_Research_and_Development_in_Information_Retrieval,_SIGIR_ 2008,_Singapore,_July_20-24,_2008, P99, DOI DOI 10.1145/1390334.1390354
  • [3] [Anonymous], NEUR NETW LEARN SYST
  • [4] [Anonymous], TECH REP
  • [5] [Anonymous], P NIPS WORKSH LEARN
  • [6] [Anonymous], 1999, WWW 1999
  • [7] [Anonymous], 2006, P ACMSIGKDD INT C KN
  • [8] [Anonymous], 2008, P 14 ACM SIGKDD INT, DOI DOI 10.1145/1401890.1401906
  • [9] [Anonymous], 2009, P 18 ACM C INFORM KN
  • [10] [Anonymous], ARXIV180107691