OrdRank: Learning to rank with ordered multiple hyperplanes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Ranking is a central problem for information retrieval systems, because the performance of an information retrieval system is mainly evaluated by the effectiveness of its ranking results. Learning to rank has received much attention in recent years due to its importance in information retrieval. This paper focuses on learning to rank in document retrieval and presents a ranking model named OrdRank that ranks documents with ordered multiple hyperplanes. Comparison of OrdRank with other state-of-the-art ranking techniques is conducted and several evaluation criteria are employed to evaluate its performance. Experimental results on the OHSUMED dataset show that OrdRank outperforms other methods, both in terms of quality of ranking results and efficiency.

Original languageEnglish
Title of host publicationProceedings - 2009 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2009
Pages560-563
Number of pages4
DOIs
StatePublished - 2009
Event2009 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2009 - Milano, Italy
Duration: 15 Sep 200918 Sep 2009

Publication series

NameProceedings - 2009 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2009
Volume1

Conference

Conference2009 IEEE/WIC/ACM International Conference on Web Intelligence, WI 2009
Country/TerritoryItaly
CityMilano
Period15/09/0918/09/09

Keywords

  • Learning to rank
  • Multiple hyperplanes
  • Order

Fingerprint

Dive into the research topics of 'OrdRank: Learning to rank with ordered multiple hyperplanes'. Together they form a unique fingerprint.

Cite this