Name: Efficient and Effective Tree-based and Neural Learning to Rank (en Inglés)
Price: 111040.00 CLP
Availability: InStock
Author: Bruch, Sebastian ; Lucchese, Claudio ; Nardini, Franco Maria
ISBN: 9781638281986

portada Efficient and Effective Tree-based and Neural Learning to Rank (en Inglés)

Formato

Libro Físico

Autor

Editorial

Idioma

Inglés

N° páginas

136

Encuadernación

Tapa Blanda

Dimensiones

23.4 x 15.6 x 0.7 cm

Peso

0.20 kg.

ISBN13

9781638281986

Categorías

Teoría de la información
Tecnología de la información: cuestiones generales
Arquitectura de la información

Efficient and Effective Tree-based and Neural Learning to Rank (en Inglés)

Sebastian Bruch (Autor) · Claudio Lucchese (Autor) · Franco Maria Nardini (Autor) · Now Publishers · Tapa Blanda

Libro Físico

$ 111.040

$ 185.060

Ahorras: $ 74.020

40% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Jueves 30 de Mayo y el Martes 11 de Junio.

Lo recibirás en cualquier lugar de Chile entre 1 y 3 días hábiles luego del envío.

Reseña del libro "Efficient and Effective Tree-based and Neural Learning to Rank (en Inglés)"

Information retrieval researchers develop algorithmic solutions to hard problems and insist on a proper, multifaceted evaluation of ideas. As we move towards even more complex deep learning models in a wide range of applications, questions on efficiency once again resurface with renewed urgency. Efficiency is no longer limited to time and space but has found new, challenging dimensions that stretch to resource-, sample- and energy-efficiency with ramifications for researchers, users, and the environment. This monograph takes a step towards promoting the study of efficiency in the era of neural information retrieval by offering a comprehensive survey of the literature on efficiency and effectiveness in ranking and retrieval. It is inspired by the parallels that exist between the challenges in neural network-based ranking solutions and their predecessors, decision forest-based learning-to-rank models, and the connections between the solutions the literature to date has to offer. By understanding the fundamentals underpinning these algorithmic and data structure solutions one can better identify future directions and more efficiently determine the merits of ideas.