{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:21:57Z","timestamp":1743034917074,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642256301"},{"type":"electronic","value":"9783642256318"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25631-8_1","type":"book-chapter","created":{"date-parts":[[2011,12,13]],"date-time":"2011-12-13T10:23:33Z","timestamp":1323771813000},"page":"1-12","source":"Crossref","is-referenced-by-count":4,"title":["Query-Dependent Rank Aggregation with Local Models"],"prefix":"10.1007","author":[{"given":"Hsuan-Yu","family":"Lin","sequence":"first","affiliation":[]},{"given":"Chi-Hsin","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Hsin-Hsi","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Joachims, T.: Optimizing search engines using clickthrough data. In: Proceedings of the Eighth International Conference on Knowledge Discovery and Data Mining (ACM SIGKDD), pp. 133\u2013142 (2002)","DOI":"10.1145\/775047.775067"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Xu, J., Li, H.: AdaRank: a boosting algorithm for information retrieval. In: SIGIR 2007, pp. 391\u2013398 (2007)","DOI":"10.1145\/1277741.1277809"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., Li, H.: Learning to rank: from pair-wise approach to list-wise approach. In: ICML 2007, pp. 129\u2013136 (2007)","DOI":"10.1145\/1273496.1273513"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Geng, X., et al.: Query dependent ranking using K-nearest neighbor. In: SIGIR 2008, pp. 115\u2013122 (2008)","DOI":"10.1145\/1390334.1390356"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-12275-0_13","volume-title":"Advances in Information Retrieval","author":"J. Peng","year":"2010","unstructured":"Peng, J., Macdonald, C., Ounis, I.: Learning to Select a Ranking Function. In: Gurrin, C., He, Y., Kazai, G., Kruschwitz, U., Little, S., Roelleke, T., R\u00fcger, S., van Rijsbergen, K. (eds.) ECIR 2010. LNCS, vol.\u00a05993, pp. 114\u2013126. Springer, Heidelberg (2010)"},{"key":"1_CR6","unstructured":"Liu, T.-Y., Xu, J., Qin, T., Xiong, W., Li, H.: LETOR: Benchmark Dataset for Research on Learning to Rank for Information Retrieval. In: LR4IR 2007, in Conjunction with SIGIR 2007 (2007)"},{"key":"1_CR7","unstructured":"Qin, T., Geng, X., Liu, T.-Y.: A New Probabilistic Model for Rank Aggregation. In: NIPS 2010 (2010)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Bian, J., Li, X., Li, F., Zheng, Z., Zha, H.: Ranking specialization for web search: a divide-and-conquer approach by using topical RankSVM. In: WWW 2010, pp. 131\u2013140 (2010)","DOI":"10.1145\/1772690.1772705"},{"key":"1_CR9","first-page":"933","volume":"4","author":"Y. Freund","year":"2003","unstructured":"Freund, Y., Iyer, R., Schapire, R.E., Singer, Y.: An efficient boosting algorithm for combining preferences. J. Machine Learning Research\u00a04, 933\u2013969 (2003)","journal-title":"J. Machine Learning Research"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"T.-Y. Liu","year":"2009","unstructured":"Liu, T.-Y.: Learning to Rank for Information Retrieval. Foundations and Trends in Information Retrieval\u00a03, 225\u2013331 (2009)","journal-title":"Foundations and Trends in Information Retrieval"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the Web. In: WWW 2001, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Farah, M., Vanderpooten, D.: An outranking approach for rank aggregation in information retrieval. In: SIGIR 2007, pp. 591\u2013598 (2007)","DOI":"10.1145\/1277741.1277843"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Bian, J., Liu, T.-Y., Qin, T., Zha, H.: Ranking with query-dependent loss for web search. In: WSDM 2010, pp. 141\u2013150 (2010)","DOI":"10.1145\/1718487.1718506"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Li, F., Li, X., Bian, J., Zheng, Z.: Optimizing Unified Loss for Web Ranking Specialization. In: CIKM 2010, pp. 1593\u20131596 (2010)","DOI":"10.1145\/1871437.1871680"}],"container-title":["Lecture Notes in Computer Science","Information Retrieval Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25631-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T14:53:20Z","timestamp":1555858400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25631-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642256301","9783642256318"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25631-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}