Listwise learning to rank with extreme order sensitive constraint via cross‐correntropy. (21st April 2020)

• Record Type: Journal Article
• Authors: Liu, Dezheng; Li, Zhongyu; Ma, Yuanyuan; Zhang, Yulong
• Other Names: Jeon Gwanggil guestEditor.; Chehri Abdellah guestEditor.; Lu Huimin guestEditor.; Guna Jože guestEditor.
• Is Part Of: Concurrency and computation. Volume 33:Number 22(2021)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2020-04-21
• Subjects: cross‐correntropy -- learning to rank -- listwise approach -- order sensitive; Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.5796
• Languages: English
• ISSNs: 1532-0626

Abstract

Summary: In information retrieval, learning to rank was originally proposed for ranking retrieved documents according to their relevance by machine learning techniques. In general, it can effectively improve the performance of critical ranking tasks, where the listwise approach is one of the most popular approaches adopted for ranking. However, considering that documents with more relevance receive greater attention, current ranking function based listwise approaches discriminate correctly ranked sequences with incorrect sequences; however, they are incapable of recognizing which incorrect sequences are relatively more satisfied. In this study, we propose a listwise approach based on an extreme order sensitive constraint to overcome the aforementioned drawback. We first define this constraint and then design a novel listwise loss function, ListXOS, based on the constraint via cross‐correntropy to improve the performance of ranking tasks. Experimental results on three public datasets present improved performance of learning to rank by 6% compared with conventional methods, which demonstrate the superiority of the proposed approach over related state‐of‐the‐art approaches.