Learning to Rank for Information Retrieval and Natural Language Processing Learning to rank refers to machine learning techniques for training the model in a ranking task. Learning to rank is useful for many applications in information retrieval, natural language processing, and data mining. Intensive studies have been conducted on the problem recently and significant progress has been made. This lecture gives an introduction to the area including the fundamental problem... Full description
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Learning to rank refers to machine learning techniques for training the model in a ranking task. Learning to rank is useful for many applications in information retrieval, natural language processing, and data mining. Intensive studies have been conducted on the problem recently and significant progress has been made. This lecture gives an introduction to the area including the fundamental problems, existing approaches, theories, applications, and future work.
The author begins by showing that various ranking problems in information retrieval and natural language processing can be formalized as two basic ranking tasks, namely ranking creation (or simply ranking) and ranking aggregation. In ranking creation, given a request, one wants to generate a ranking list of offerings based on the features derived from the request and the offerings. In ranking aggregation, given a request, as well as a number of ranking lists of offerings, one wants to generate a new ranking list of the offerings.
Ranking creation (or ranking) is the major problem in learning to rank. It is usually formalized as a supervised learning task. The author gives detailed explanations on learning for ranking creation and ranking aggregation, including training and testing, evaluation, feature creation, and major approaches. Many methods have been proposed for ranking creation. The methods can be categorized as the pointwise, pairwise, and listwise approaches according to the loss functions they employ. They can also be categorized according to the techniques they employ, such as the SVM based, Boosting SVM, Neural Network based approaches.
The author also introduces some popular learning to rank methods in details. These include PRank, OC SVM, Ranking SVM, IR SVM, GBRank, RankNet, LambdaRank, ListNet & ListMLE, AdaRank, SVM MAP, SoftRank, Borda Count, Markov Chain, and CRanking.
The author explains several example applications of learning to rank including web search, collaborative filtering, definition search, keyphrase extraction, query dependent summarization, and re-ranking in machine translation.
A formulation of learning for ranking creation is given in the statistical learning framework. Ongoing and future research directions for learning to rank are also discussed.
Table of Contents: Introduction / Learning for Ranking Creation / Learning for Ranking Aggregation / Methods of Learning to Rank / Applications of Learning to Rank / Theory of Learning to Rank / Ongoing and Future Work
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 3,60 expédition vers Etats-Unis
Destinations, frais et délaisVendeur : suffolkbooks, Center moriches, NY, Etats-Unis
paperback. Etat : Very Good. Fast Shipping - Safe and Secure 7 days a week! N° de réf. du vendeur 3TWDDA002HF9
Quantité disponible : 4 disponible(s)
Vendeur : The Book Bin, Salem, OR, Etats-Unis
Paperback. Etat : Very Good. First Edition. Binding firm, cover has shelf wear, interior clean and unmarked. Top corner curled. First Edition. N° de réf. du vendeur CORV-BBC-0K67314
Quantité disponible : 1 disponible(s)
Vendeur : Studibuch, Stuttgart, Allemagne
paperback. Etat : Gut. 114 Seiten; 9781608457076.3 Gewicht in Gramm: 500. N° de réf. du vendeur 523193
Quantité disponible : 1 disponible(s)
Vendeur : dsmbooks, Liverpool, Royaume-Uni
paperback. Etat : Very Good. Very Good. book. N° de réf. du vendeur D8S0-3-M-1608457079-4
Quantité disponible : 1 disponible(s)