WCL2R : a benchmark collection for Learning to rank research with clickthrough data.
WCL2R: A benchmark collection for Learning to rank research with clickthrough data In this paper we present WCL2R, a benchmark collection for supporting research in learning to rank (L2R) algorithms which exploit clickthrough features. Differently from other L2R benchmark collections, such as LETOR...
| Autores: | , , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| País: | Brasil |
| Institución: | Universidade Federal de Ouro Preto (UFOP) |
| Repositorio: | Repositório Institucional da UFOP |
| Idioma: | inglés |
| OAI Identifier: | oai:repositorio.ufop.br:123456789/1630 |
| Acceso en línea: | http://www.repositorio.ufop.br/handle/123456789/1630 |
| Access Level: | acceso abierto |
| Palabra clave: | Benchmark Clicktrough Learning to rank |
| Sumario: | WCL2R: A benchmark collection for Learning to rank research with clickthrough data In this paper we present WCL2R, a benchmark collection for supporting research in learning to rank (L2R) algorithms which exploit clickthrough features. Differently from other L2R benchmark collections, such as LETOR and the recently released Yahoo!’s collection for a L2R competition, in WCL2R we focus on defining a significant (and new) set of features over clickthrough data extracted from the logs of a real-world search engine. In this paper, we describe the WCL2R collection by providing details about how the corpora, queries and relevance judgments were obtained, how the learning features were constructed and how the process of splitting the collection in folds for representative learning was performed. We also analyze the discriminative power of the WCL2R collection using traditional feature selection algorithms and show that the most discriminative features are, in fact, those based on clickthrough data. We then compare several L2R algorithms on WCL2R, showing that all of them obtain significant gains by exploiting clickthrough information over using traditional ranking approaches. |
|---|