SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "onr:"swepub:oai:DiVA.org:mdh-28726" "

Search: onr:"swepub:oai:DiVA.org:mdh-28726"

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Capannini, Gabriele, et al. (author)
  • QuickRank : A C++ suite of learning to rank algorithms
  • 2015
  • In: CEUR Workshop Proceedings.
  • Conference paper (peer-reviewed)abstract
    • Ranking is a central task of many Information Retrieval (IR) problems, particularly challenging in the case of large-scale Web collections where it involves effectiveness requirements and effciency constraints that are not common to other ranking-based applications. This paper describes QuickRank, a C++ suite of effcient and effective Learning to Rank (LtR) algorithms that allows high-quality ranking functions to be devised from possibly huge training datasets. QuickRank is a project with a double goal: i) answering industrial need of Tiscali S.p.A. for a exible and scalable LtR solution for learning ranking models from huge training datasets; ii) providing the IR research community with a exible, extensible and effcient LtR framework to design LtR solutions and fairly compare the performance of different algorithms and ranking models. This paper presents our choices in designing QuickRank and report some preliminary use experiences.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1
Type of publication
conference paper (1)
Type of content
peer-reviewed (1)
Author/Editor
Mori, M. (1)
Orlando, S. (1)
Capannini, Gabriele (1)
Nardini, F.M. (1)
Lucchese, C. (1)
Perego, R. (1)
show more...
Tonellotto, N. (1)
Dato, D. (1)
show less...
University
Mälardalen University (1)
Language
English (1)
Research subject (UKÄ/SCB)
Engineering and Technology (1)
Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view