{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T09:44:26Z","timestamp":1753868666508,"version":"3.41.2"},"reference-count":37,"publisher":"Wiley","issue":"22","license":[{"start":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T00:00:00Z","timestamp":1587427200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902310"],"award-info":[{"award-number":["61902310"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2021,11,25]]},"abstract":"<jats:title>Summary<\/jats:title><jats:p>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\u2010correntropy 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\u2010of\u2010the\u2010art approaches.<\/jats:p>","DOI":"10.1002\/cpe.5796","type":"journal-article","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T12:27:53Z","timestamp":1587472073000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Listwise learning to rank with extreme order sensitive constraint via cross\u2010correntropy"],"prefix":"10.1002","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8690-2579","authenticated-orcid":false,"given":"Dezheng","family":"Liu","sequence":"first","affiliation":[{"name":"Xi'an Jiaotong University  Xi'an China"}]},{"given":"Zhongyu","family":"Li","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University  Xi'an China"}]},{"given":"Yuanyuan","family":"Ma","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Rail Transit Engineering Informatization (FSDI)  Xi'an China"}]},{"given":"Yulong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Xi'an Jiaotong University  Xi'an China"}]}],"member":"311","published-online":{"date-parts":[[2020,4,21]]},"reference":[{"key":"e_1_2_7_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.62"},{"key":"e_1_2_7_3_1","doi-asserted-by":"crossref","unstructured":"QuG XiaoJ ZhuJ CaoY HuangC. Cross\u2010modal learning to rank with adaptive listwise constraint. Paper presented at: Proceedings of the 2018 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP);2018:1658\u20101662; IEEE.","DOI":"10.1109\/ICASSP.2018.8462599"},{"key":"e_1_2_7_4_1","doi-asserted-by":"crossref","unstructured":"ShiY LarsonM HanjalicA. List\u2010wise learning to rank with matrix factorization for collaborative filtering. Paper presented at: Proceedings of the 4th ACM Conference on Recommender Systems;2010: 269\u2010272; ACM.","DOI":"10.1145\/1864708.1864764"},{"key":"e_1_2_7_5_1","doi-asserted-by":"crossref","unstructured":"TayY PhanMC TuanLA HuiSC. Learning to rank estion answer pairs with holographic dual LSTM architecture;2017. arXiv: arXiv. 2017;1707.https:\/\/doi.org\/10.1145\/3077136.3080790.","DOI":"10.1145\/3077136.3080790"},{"key":"e_1_2_7_6_1","doi-asserted-by":"crossref","unstructured":"LiuX WeijerJ BagdanovAD. Leveraging unlabeled data for crowd counting by learning to rank. Paper presented at: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition;2018: 7661\u20107669; IEEE.","DOI":"10.1109\/CVPR.2018.00799"},{"key":"e_1_2_7_7_1","doi-asserted-by":"crossref","unstructured":"SavinovN SekiA LadickyL SattlerT PollefeysM. Quad\u2010networks: unsupervised learning to rank for interest point detection. Paper presented at: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition;2017:1822\u20101830; IEEE.","DOI":"10.1109\/CVPR.2017.418"},{"key":"e_1_2_7_8_1","doi-asserted-by":"crossref","unstructured":"YanJ LinS BingKS TangX. A learning\u2010to\u2010rank approach for image color enhancement. Paper presented at: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition;2014:2987\u20102994; IEEE.","DOI":"10.1109\/CVPR.2014.382"},{"key":"e_1_2_7_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-017-0932-8"},{"key":"e_1_2_7_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2019.1800325"},{"key":"e_1_2_7_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2018.05.007"},{"key":"e_1_2_7_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2928180"},{"key":"e_1_2_7_13_1","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.E94.D.1854"},{"key":"e_1_2_7_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2535214"},{"key":"e_1_2_7_15_1","first-page":"641","volume-title":"Advances in Neural Information Processing Systems","author":"Crammer K","year":"2002"},{"key":"e_1_2_7_16_1","doi-asserted-by":"crossref","unstructured":"BurgesC ShakedT RenshawE et al. Learning to rank using gradient descent. Paper presented at: Proceedings of the 22nd International Conference on Machine learning (ICML\u201005);2005:89\u201096; ACM.","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_2_7_17_1","doi-asserted-by":"crossref","unstructured":"CaoZ QinT LiuTY TsaiM\u2010F LiH. Learning to rank: from pairwise approach to listwise approach. Paper presented at: Proceedings of the 24th International Conference on Machine Learning;2007:129\u2010136; ACM.","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_2_7_18_1","unstructured":"QinT LiuT\u2010Y. Introducing LETOR 4.0 datasets;2013. arXiv preprint arXiv:1306.2597."},{"key":"e_1_2_7_19_1","doi-asserted-by":"crossref","unstructured":"PangL LanY GuoJ XuJ XuJ ChengX. Deeprank: a new deep architecture for relevance ranking in information retrieval. Paper presented at: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management;2017:257\u2010266 ACM.","DOI":"10.1145\/3132847.3132914"},{"key":"e_1_2_7_20_1","doi-asserted-by":"crossref","unstructured":"FanY GuoJ LanY XuJ ZhaiC ChengX. Modeling diverse relevance patterns in ad\u2010hoc retrieval. Paper presented at: Proceedings of the 41st International ACM SIGIR Conference on Research & Development in Information Retrieval;2018:375\u2010384; ACM.","DOI":"10.1145\/3209978.3209980"},{"key":"e_1_2_7_21_1","doi-asserted-by":"crossref","unstructured":"CossockD ZhangT. Subset ranking using regression. Paper presented at: Proceedings of the International Conference on Computational Learning Theory;2006:605\u2010619 Springer.","DOI":"10.1007\/11776420_44"},{"key":"e_1_2_7_22_1","first-page":"897","volume-title":"Advances in Neural Information Processing Systems","author":"Li P","year":"2008"},{"key":"e_1_2_7_23_1","first-page":"961","volume-title":"Advances in Neural Information Processing Systems","author":"Shashua A","year":"2003"},{"key":"e_1_2_7_24_1","doi-asserted-by":"crossref","unstructured":"CaoY XuJ LiuT\u2010Y LiH HuangY HonH\u2010W. Adapting ranking SVM to document retrieval. Paper presented at: Proceedings of the Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval;2006:186\u2010193; ACM.","DOI":"10.1145\/1148170.1148205"},{"key":"e_1_2_7_25_1","first-page":"933","article-title":"An efficient boosting algorithm for combining preferences","volume":"4","author":"Freund Y","year":"2003","journal-title":"J Mach Learn Res"},{"key":"e_1_2_7_26_1","first-page":"193","volume-title":"Advances in Neural Information Processing Systems","author":"Burges CJ","year":"2007"},{"key":"e_1_2_7_27_1","first-page":"1697","volume-title":"Advances in Neural Information Processing Systems","author":"Zheng Z","year":"2008"},{"key":"e_1_2_7_28_1","doi-asserted-by":"crossref","unstructured":"XiaF LiuT\u2010Y WangJ ZhangW LiH. Listwise approach to learning to rank: theory and algorithm. Paper presented at: Proceedings of the 25th International Conference on Machine Learning;2008:1192\u20101199; ACM.","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_2_7_29_1","doi-asserted-by":"publisher","DOI":"10.1049\/el.2018.0815"},{"key":"e_1_2_7_30_1","doi-asserted-by":"crossref","unstructured":"XuJ LiH. Adarank: a boosting algorithm for information retrieval. Paper presented at: Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval;2007:391\u2010398; ACM.","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_2_7_31_1","unstructured":"QinTao LiuTie\u2010Yan TsaiMing\u2010Feng ZhangXu\u2010Dong LiHang. Learning to search web pages with query\u2010level loss functions. Technical Report;2006:156."},{"key":"e_1_2_7_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9112-1"},{"key":"e_1_2_7_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2016.12.021"},{"key":"e_1_2_7_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.08.004"},{"key":"e_1_2_7_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2856253"},{"key":"e_1_2_7_36_1","doi-asserted-by":"crossref","unstructured":"SeverynA MoschittiA. Learning to rank short text pairs with convolutional deep neural networks. Paper presented at: Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval;2015:373\u2010382; ACM.","DOI":"10.1145\/2766462.2767738"},{"key":"e_1_2_7_37_1","doi-asserted-by":"crossref","unstructured":"MohanS FioriniN KimS LuZ. A fast deep learning model for textual relevance in biomedical information retrieval. Paper presented at: Proceedings of the 2018 World Wide Web ConferenceInternational World Wide Web Conferences Steering Committee;2018:77\u201086.","DOI":"10.1145\/3178876.3186049"},{"key":"e_1_2_7_38_1","doi-asserted-by":"crossref","unstructured":"NiuS GuoJ LanY ChengX. Top\u2010k learning to rank: labeling ranking and evaluation. Paper presented at: Proceedings of the 35th International ACM SIGIR Conference on Research and Development in Information Retrieval;2012:751\u2010760; ACM.","DOI":"10.1145\/2348283.2348384"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcpe.5796","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.5796","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full-xml\/10.1002\/cpe.5796","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.5796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T14:04:58Z","timestamp":1693317898000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.5796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,21]]},"references-count":37,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2021,11,25]]}},"alternative-id":["10.1002\/cpe.5796"],"URL":"https:\/\/doi.org\/10.1002\/cpe.5796","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"type":"print","value":"1532-0626"},{"type":"electronic","value":"1532-0634"}],"subject":[],"published":{"date-parts":[[2020,4,21]]},"assertion":[{"value":"2019-12-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-29","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e5796"}}