{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T09:16:26Z","timestamp":1782378986969,"version":"3.54.5"},"reference-count":26,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2015dap0001","type":"journal-article","created":{"date-parts":[[2016,3,31]],"date-time":"2016-03-31T22:20:46Z","timestamp":1459462846000},"page":"896-905","source":"Crossref","is-referenced-by-count":4,"title":["BLM-Rank: A Bayesian Linear Method for Learning to Rank and Its GPU Implementation"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Huifeng","family":"GUO","sequence":"first","affiliation":[{"name":"Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen Graduate School, Harbin Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dianhui","family":"CHU","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Technology, Harbin Institute of Technology at Weihai"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunming","family":"YE","sequence":"additional","affiliation":[{"name":"Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen Graduate School, Harbin Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xutao","family":"LI","sequence":"additional","affiliation":[{"name":"Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen Graduate School, Harbin Institute of Technology"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xixian","family":"FAN","sequence":"additional","affiliation":[{"name":"Baidu Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"532","reference":[{"key":"1","unstructured":"[1] L. Page, S. Brin, R. Motwani, and T. Winograd, \u201cThe pagerank citation ranking: bringing order to the web,\u201d 1999."},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] J.M. Kleinberg, \u201cAuthoritative sources in a hyperlinked environment,\u201d Journal of the ACM (JACM), vol.46, no.5, pp.604-632, 1999.","DOI":"10.1145\/324133.324140"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M.K.-P. Ng, X. Li, and Y. Ye, \u201cMultirank: co-ranking for objects and relations in multi-relational data,\u201d Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.1217-1225, ACM, 2011.","DOI":"10.1145\/2020408.2020594"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] X. Li, M.K. Ng, and Y. Ye, \u201cHar: Hub, authority and relevance scores in multi-relational data for query search,\u201d SDM, pp.141-152, 2012.","DOI":"10.1137\/1.9781611972825.13"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] J.M. Ponte and W.B. Croft, \u201cA language modeling approach to information retrieval,\u201d Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, pp.275-281, ACM, 1998.","DOI":"10.1145\/290941.291008"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] S.E. Robertson and K.S. Jones, \u201cRelevance weighting of search terms,\u201d Journal of the American Society for Information science, vol.27, no.3, pp.129-146, 1976.","DOI":"10.1002\/asi.4630270302"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] S.E. Robertson and S. Walker, \u201cSome simple effective approximations to the 2-Poisson model for probabilistic weighted retrieval,\u201d Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval, pp.232-241, Springer-Verlag New York, 1994.","DOI":"10.1007\/978-1-4471-2099-5_24"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] D. Cossock and T. Zhang, \u201cSubset ranking using regression,\u201d in Learning theory, pp.605-619, Springer, 2006.","DOI":"10.1007\/11776420_44"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] R. Herbrich, T. Graepel, and K. Obermayer, \u201cLarge margin rank boundaries for ordinal regression,\u201d Advances in Neural Information Processing Systems, pp.115-132, 1999.","DOI":"10.7551\/mitpress\/1113.003.0010"},{"key":"10","unstructured":"[10] Y. Freund, R. Iyer, R.E. Schapire, and Y. Singer, \u201cAn efficient boosting algorithm for combining preferences,\u201d Journal of Machine Learning Research, vol.4, pp.933-969, 2003."},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, and G. Hullender, \u201cLearning to rank using gradient descent,\u201d Proceedings of the 22nd international conference on Machine learning, pp.89-96, ACM, 2005.","DOI":"10.1145\/1102351.1102363"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] J. Xu and H. Li, \u201cAdarank: a boosting algorithm for information retrieval,\u201d Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pp.391-398, ACM, 2007.","DOI":"10.1145\/1277741.1277809"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] Z. Cao, T. Qin, T.Y. Liu, M.-F. Tsai, and H. Li, \u201cLearning to rank: from pairwise approach to listwise approach,\u201d Proceedings of the 24th international conference on Machine learning, pp.129-136, ACM, 2007.","DOI":"10.1145\/1273496.1273513"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] K. Crammer, Y. Singer, et al., \u201cPranking with ranking,\u201d NIPS, pp.641-647, 2001.","DOI":"10.7551\/mitpress\/1120.003.0087"},{"key":"15","unstructured":"[15] R. Caruana, S. Baluja, T. Mitchell, et al., \u201cUsing the future to \u201csort out\u201d the present: Rankprop and multitask learning for medical risk evaluation,\u201d Advances in Neural Information Processing Systems, pp.959-965, 1996."},{"key":"16","unstructured":"[16] C. Burges, \u201cFrom ranknet to lambdarank to lambdamart: An overview,\u201d Learning, vol.11, pp.23-581, 2010."},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] M.-F. Tsai, T.-Y. Liu, T. Qin, H.-H. Chen, and W.-Y. Ma, \u201cFrank: a ranking method with fidelity loss,\u201d Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, pp.383-390, ACM, 2007.","DOI":"10.1145\/1277741.1277808"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[18] I. Matveeva, C. Burges, T. Burkard, A. Laucius, and L. Wong, \u201cHigh accuracy retrieval with multiple nested ranker,\u201d Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, pp.437-444, ACM, 2006.","DOI":"10.1145\/1148170.1148246"},{"key":"19","unstructured":"[19] S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme, \u201cBPR: Bayesian personalized ranking from implicit feedback,\u201d Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, pp.452-461, AUAI Press, 2009."},{"key":"20","doi-asserted-by":"crossref","unstructured":"[20] S. Rendle and L. Schmidt-Thieme, \u201cPairwise interaction tensor factorization for personalized tag recommendation,\u201d Proceedings of the third ACM international conference on Web search and data mining, pp.81-90, ACM, 2010.","DOI":"10.1145\/1718487.1718498"},{"key":"21","unstructured":"[21] W. Pan and L. Chen, \u201cGBPR: Group preference based bayesian personalized ranking for one-class collaborative filtering,\u201d Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, pp.2691-2697, AAAI Press, 2013."},{"key":"22","doi-asserted-by":"crossref","unstructured":"[22] A. Krohn-Grimberghe, L. Drumond, C. Freudenthaler, and L. Schmidt-Thieme, \u201cMulti-relational matrix factorization using bayesian personalized ranking for social network data,\u201d Proceedings of the fifth ACM international conference on Web search and data mining, pp.173-182, ACM, 2012.","DOI":"10.1145\/2124295.2124317"},{"key":"23","doi-asserted-by":"crossref","unstructured":"[23] L. Lerche and D. Jannach, \u201cUsing graded implicit feedback for bayesian personalized ranking,\u201d Proceedings of the 8th ACM Conference on Recommender systems, pp.353-356, ACM, 2014.","DOI":"10.1145\/2645710.2645759"},{"key":"24","unstructured":"[24] T.Y. Liu, J. Xu, T. Qin, W. Xiong, and H. Li, \u201cLetor: Benchmark dataset for research on learning to rank for information retrieval,\u201d Proceedings of SIGIR 2007 workshop on learning to rank for information retrieval, pp.3-10, 2007."},{"key":"25","doi-asserted-by":"crossref","unstructured":"[25] T. Qin, T.-Y. Liu, J. Xu, and H. Li, \u201cLetor: A benchmark collection for research on learning to rank for information retrieval,\u201d Information Retrieval, vol.13, no.4, pp.346-374, 2010.","DOI":"10.1007\/s10791-009-9123-y"},{"key":"26","doi-asserted-by":"crossref","unstructured":"[26] K. J\u00e4rvelin and J. Kek\u00e4l\u00e4inen, \u201cCumulated gain-based evaluation of ir techniques,\u201d ACM Transactions on Information Systems (TOIS), vol.20, no.4, pp.422-446, 2002.","DOI":"10.1145\/582415.582418"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/4\/E99.D_2015DAP0001\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T11:47:19Z","timestamp":1718452039000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/4\/E99.D_2015DAP0001\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015dap0001","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}