{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:05:22Z","timestamp":1761807922271},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,5,13]],"date-time":"2015-05-13T00:00:00Z","timestamp":1431475200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10115-015-0840-9","type":"journal-article","created":{"date-parts":[[2015,5,13]],"date-time":"2015-05-13T16:36:22Z","timestamp":1431534982000},"page":"157-188","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Modelling human preferences for ranking and collaborative filtering: a probabilistic ordered partition approach"],"prefix":"10.1007","volume":"47","author":[{"given":"Truyen","family":"Tran","sequence":"first","affiliation":[]},{"given":"Dinh","family":"Phung","sequence":"additional","affiliation":[]},{"given":"Svetha","family":"Venkatesh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,13]]},"reference":[{"issue":"6","key":"840_CR1","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1109\/TKDE.2005.99","volume":"17","author":"G Adomavicius","year":"2005","unstructured":"Adomavicius G, Tuzhilin A (2005) Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Trans Knowl Data Eng 17(6):734\u2013749","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"840_CR2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10115-010-0338-4","volume":"28","author":"L Becchetti","year":"2011","unstructured":"Becchetti L, Colesanti UM, Marchetti-Spaccamela A, Vitaletti A (2011) Recommending items in pervasive scenarios: models and experimental analysis. Knowl Inf Syst 28(3):555\u2013578","journal-title":"Knowl Inf Syst"},{"key":"840_CR3","first-page":"324","volume":"39","author":"RA Bradley","year":"1952","unstructured":"Bradley RA, Terry ME (1952) Rank analysis of incomplete block designs. Biometrika 39:324\u2013345","journal-title":"Biometrika"},{"issue":"1\u20137","key":"840_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0169-7552(98)00110-X","volume":"30","author":"S Brin","year":"1998","unstructured":"Brin S, Page L (1998) The anatomy of a large-scale hypertextual Web search engine. Comput Netw ISDN Syst 30(1\u20137):107\u2013117","journal-title":"Comput Netw ISDN Syst"},{"key":"840_CR5","doi-asserted-by":"crossref","unstructured":"Burges C, Shaked T, Renshaw E, Lazier A, Deeds M, Hamilton N, Hullender G (2005) Learning to rank using gradient descent. In: Proceedings of ICML, 96","DOI":"10.1145\/1102351.1102363"},{"key":"840_CR6","doi-asserted-by":"crossref","unstructured":"Cao Z, Qin T, Liu TY, Tsai MF, Li H (2007) Learning to rank: from pairwise approach to listwise approach. In: Proceedings of the 24th international conference on machine learning, 136 pp. ACM","DOI":"10.1145\/1273496.1273513"},{"key":"840_CR7","unstructured":"Carreira-Perpi\u00f1\u00e1n MA, Hinton GE (2005) On contrastive divergence learning. In: Cowell RG, Ghahramani Z (eds) Proceedings of the 10th international workshop on artificial intelligence and statistics (AISTATS). Society for Artificial Intelligence and Statistics, Barbados, pp 33\u201340, Jan 6\u20138"},{"key":"840_CR8","unstructured":"Chapelle O, Chang Y (2011) Yahoo! learning to rank challenge overview. JMLR workshop and conference proceedings, vol 14, pp 1\u201324"},{"key":"840_CR9","doi-asserted-by":"crossref","unstructured":"Chapelle O, Metlzer D, Zhang Y, Grinspan P (2009) Expected reciprocal rank for graded relevance. In: CIKM. ACM, pp 621\u2013630","DOI":"10.1145\/1645953.1646033"},{"issue":"1","key":"840_CR10","first-page":"1019","volume":"6","author":"W Chu","year":"2006","unstructured":"Chu W, Ghahramani Z (2006) Gaussian processes for ordinal regression. J Mach Learn Res 6(1):1019","journal-title":"J Mach Learn Res"},{"issue":"3","key":"840_CR11","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1162\/neco.2007.19.3.792","volume":"19","author":"W Chu","year":"2007","unstructured":"Chu W, Keerthi SS (2007) Support vector ordinal regression. Neural Comput 19(3):792\u2013815","journal-title":"Neural Comput"},{"issue":"11","key":"840_CR12","doi-asserted-by":"crossref","first-page":"5140","DOI":"10.1109\/TIT.2008.929939","volume":"54","author":"D Cossock","year":"2008","unstructured":"Cossock D, Zhang T (2008) Statistical analysis of Bayes optimal subset ranking. IEEE Trans Inf Theory 54(11):5140\u20135154","journal-title":"IEEE Trans Inf Theory"},{"issue":"329","key":"840_CR13","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1080\/01621459.1970.10481082","volume":"65","author":"RR Davidson","year":"1970","unstructured":"Davidson RR (1970) On extending the Bradley-Terry model to accommodate ties in paired comparison experiments. J Am Stat Assoc 65(329):317\u2013328","journal-title":"J Am Stat Assoc"},{"key":"840_CR14","doi-asserted-by":"crossref","DOI":"10.1214\/lnms\/1215467407","volume-title":"Group representations in probability and statistics","author":"P Diaconis","year":"1988","unstructured":"Diaconis P (1988) Group representations in probability and statistics. Institute of Mathematical Statistics Hayward, CA"},{"issue":"1\u20132","key":"840_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0004-3702(96)00034-3","volume":"89","author":"TG Dietterich","year":"1997","unstructured":"Dietterich TG, Lathrop RH, Lozano-P\u00e9rez T (1997) Solving the multiple instance problem with axis-parallel rectangles. Artif Intell 89(1\u20132):31\u201371","journal-title":"Artif Intell"},{"issue":"403","key":"840_CR16","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1080\/01621459.1988.10478679","volume":"83","author":"MA Fligner","year":"1988","unstructured":"Fligner MA, Verducci JS (1988) Multistage ranking models. J Am Stat Assoc 83(403):892\u2013901","journal-title":"J Am Stat Assoc"},{"issue":"6","key":"840_CR17","first-page":"933","volume":"4","author":"Y Freund","year":"2004","unstructured":"Freund Y, Iyer R, Schapire RE, Singer Y (2004) An efficient boosting algorithm for combining preferences. J Mach Learn Res 4(6):933\u2013969","journal-title":"J Mach Learn Res"},{"key":"840_CR18","volume-title":"Preference learning","author":"J F\u00fcrnkranz","year":"2010","unstructured":"F\u00fcrnkranz J, H\u00fcllermeier E (2010) Preference learning. Springer, New York"},{"issue":"6","key":"840_CR19","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TPAMI.1984.4767596","volume":"6","author":"S Geman","year":"1984","unstructured":"Geman S, Geman D (1984) Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Trans Pattern Anal Mach Intell PAMI 6(6):721\u2013742","journal-title":"IEEE Trans Pattern Anal Mach Intell PAMI"},{"issue":"1","key":"840_CR20","doi-asserted-by":"crossref","first-page":"86","DOI":"10.2307\/2527957","volume":"16","author":"WA Glenn","year":"1960","unstructured":"Glenn WA, David HA (1960) Ties in paired-comparison experiments using a modified Thurstone-Mosteller model. Biometrics 16(1):86\u2013109","journal-title":"Biometrics"},{"issue":"1","key":"840_CR21","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1093\/biomet\/57.1.97","volume":"57","author":"WK Hastings","year":"1970","unstructured":"Hastings WK (1970) Monte Carlo sampling methods using Markov chains and their applications. Biometrika 57(1):97\u2013109","journal-title":"Biometrika"},{"key":"840_CR22","doi-asserted-by":"crossref","first-page":"1771","DOI":"10.1162\/089976602760128018","volume":"14","author":"GE Hinton","year":"2002","unstructured":"Hinton GE (2002) Training products of experts by minimizing contrastive divergence. Neural Comput 14:1771\u20131800","journal-title":"Neural Comput"},{"issue":"5786","key":"840_CR23","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1126\/science.1127647","volume":"313","author":"GE Hinton","year":"2006","unstructured":"Hinton GE, Salakhutdinov RR (2006) Reducing the dimensionality of data with neural networks. Science 313(5786):504\u2013507","journal-title":"Science"},{"key":"840_CR24","first-page":"997","volume":"10","author":"J Huang","year":"2009","unstructured":"Huang J, Guestrin C, Guibas L (2009) Fourier theoretic probabilistic inference over permutations. J Mach Learn Res 10:997\u20131070","journal-title":"J Mach Learn Res"},{"key":"840_CR25","first-page":"115","volume":"7","author":"TK Huang","year":"2006","unstructured":"Huang TK, Weng RC, Lin CJ (2006) Generalized Bradley-Terry models and multi-class probability estimates. J Mach Learn Res 7:115","journal-title":"J Mach Learn Res"},{"issue":"4","key":"840_CR26","first-page":"446","volume":"20","author":"K J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin K, Kek\u00e4l\u00e4inen J (2002) Cumulated gain-based evaluation of IR techniques. ACM Trans Inf Syst TOIS 20(4):446","journal-title":"ACM Trans Inf Syst TOIS"},{"key":"840_CR27","doi-asserted-by":"crossref","unstructured":"Joachims T (2002) Optimizing search engines using clickthrough data. In: Proceedings of SIGKDD. ACM, New York, NY, USA, pp 133\u2013142","DOI":"10.1145\/775047.775067"},{"issue":"1\/2","key":"840_CR28","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall MG (1938) A new measure of rank correlation. Biometrika 30(1\/2):81\u201393","journal-title":"Biometrika"},{"key":"840_CR29","doi-asserted-by":"crossref","unstructured":"Koren Y (2008) Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: KDD","DOI":"10.1145\/1401890.1401944"},{"key":"840_CR30","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522195.001.0001","volume-title":"Graphical models","author":"SL Lauritzen","year":"1996","unstructured":"Lauritzen SL (1996) Graphical models. Oxford Science Publications, Oxford"},{"key":"840_CR31","first-page":"2401","volume":"9","author":"G Lebanon","year":"2008","unstructured":"Lebanon G, Mao Y (2008) Non-parametric modeling of partially ranked data. J Mach Learn Res 9:2401\u20132429","journal-title":"J Mach Learn Res"},{"issue":"3","key":"840_CR32","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10115-006-0002-1","volume":"10","author":"CW Leung","year":"2006","unstructured":"Leung CW, Chan SC, Chung F (2006) A collaborative filtering framework based on fuzzy association rules and multiple-level similarity. Knowl Inf Syst 10(3):357\u2013381","journal-title":"Knowl Inf Syst"},{"key":"840_CR33","doi-asserted-by":"crossref","unstructured":"Liu NN, Zhao M, Yang Q (2009) Probabilistic latent preference analysis for collaborative filtering. In: CIKM. ACM, pp 759\u2013766","DOI":"10.1145\/1645953.1646050"},{"issue":"3","key":"840_CR34","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1561\/1500000016","volume":"3","author":"TY Liu","year":"2009","unstructured":"Liu TY (2009) Learning to rank for information retrieval. Found Trends Inf Retr 3(3):225\u2013331","journal-title":"Found Trends Inf Retr"},{"key":"840_CR35","volume-title":"Individual choice behavior","author":"RD Luce","year":"1959","unstructured":"Luce RD (1959) Individual choice behavior. Wiley, New York"},{"issue":"1","key":"840_CR36","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1093\/biomet\/44.1-2.114","volume":"44","author":"CL Mallows","year":"1957","unstructured":"Mallows CL (1957) Non-null ranking models. I. Biometrika 44(1):114\u2013130","journal-title":"Biometrika"},{"key":"840_CR37","volume-title":"Analyzing and modeling rank data","author":"JI Marden","year":"1995","unstructured":"Marden JI (1995) Analyzing and modeling rank data. Chapman & Hall\/CRC, London"},{"key":"840_CR38","unstructured":"Marlin B, Swersky K, Chen B, de Freitas N (May 2010) Inductive principles for restricted boltzmann machine learning. In: Proceedings of the 13rd international conference on artificial intelligence and statistics, Chia Laguna Resort, Sardinia, Italy"},{"key":"840_CR39","volume-title":"A concrete approach to classical analysis","author":"M Mure\u015fan","year":"2008","unstructured":"Mure\u015fan M (2008) A concrete approach to classical analysis. Springer, Berlin"},{"issue":"2","key":"840_CR40","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1008923215028","volume":"11","author":"RM Neal","year":"2001","unstructured":"Neal RM (2001) Annealed importance sampling. Stat Comput 11(2):125\u2013139","journal-title":"Stat Comput"},{"issue":"2","key":"840_CR41","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2307\/2346567","volume":"24","author":"RL Plackett","year":"1975","unstructured":"Plackett RL (1975) The analysis of permutations. Appl Stat 24(2):193\u2013202","journal-title":"Appl Stat"},{"issue":"317","key":"840_CR42","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1080\/01621459.1967.10482901","volume":"62","author":"PV Rao","year":"1967","unstructured":"Rao PV, Kupper LL (1967) Ties in paired-comparison experiments: a generalization of the Bradley-Terry model. J Am Stat Assoc 62(317):194\u2013204","journal-title":"J Am Stat Assoc"},{"key":"840_CR43","doi-asserted-by":"crossref","unstructured":"Resnick P, Iacovou N, Suchak M, Bergstorm P, Riedl J (1994) GroupLens: an open architecture for collaborative filtering of netnews. In: Proceedings of ACM conference on computer supported cooperative work. Chapel Hill, North Carolina. ACM, pp 175\u2013186","DOI":"10.1145\/192844.192905"},{"key":"840_CR44","doi-asserted-by":"crossref","unstructured":"Sarwar B, Karypis G, Konstan J, Reidl J (2001) Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th international conference on World Wide Web. ACM Press, New York, NY, USA, pp 285\u2013295","DOI":"10.1145\/371920.372071"},{"key":"840_CR45","doi-asserted-by":"crossref","unstructured":"Shi Y, Larson M, Hanjalic A (2010) List-wise learning to rank with matrix factorization for collaborative filtering. In: ACM RecSys. ACM, pp 269\u2013272","DOI":"10.1145\/1864708.1864764"},{"issue":"1","key":"840_CR46","doi-asserted-by":"crossref","first-page":"72","DOI":"10.2307\/1412159","volume":"15","author":"C Spearman","year":"1904","unstructured":"Spearman C (1904) The proof and measurement of association between two things. Am J Psychol 15(1):72\u2013101","journal-title":"Am J Psychol"},{"key":"840_CR47","doi-asserted-by":"crossref","unstructured":"Tieleman T, Hinton G (2009) Using fast weights to improve persistent contrastive divergence. In: Proceedings of the 26th annual international conference on machine learning. ACM, New York, NY, USA","DOI":"10.1145\/1553374.1553506"},{"key":"840_CR48","doi-asserted-by":"crossref","unstructured":"Truyen T, Phung DQ, Venkatesh S (2011) Probabilistic models over ordered partitions with applications in document ranking and collaborative filtering. In: Proceedings of SIAM conference on data mining (SDM), Mesa, Arizona, USA. SIAM","DOI":"10.1137\/1.9781611972818.37"},{"key":"840_CR49","volume-title":"A course in combinatorics","author":"JH Lint van","year":"1992","unstructured":"van Lint JH, Wilson RM (1992) A course in combinatorics. Cambridge University Press, Cambridge"},{"key":"840_CR50","doi-asserted-by":"crossref","unstructured":"Vembu S, G\u00e4rtner T (2010) Label ranking algorithms: a survey. In Preference learning, p 45","DOI":"10.1007\/978-3-642-14125-6_3"},{"key":"840_CR51","doi-asserted-by":"crossref","unstructured":"Volkovs MN, Zemel RS (2009) BoltzRank: learning to maximize expected ranking gain. In: Proceedings of the 26th annual international conference on machine learning. ACM, New York, NY, USA","DOI":"10.1145\/1553374.1553513"},{"key":"840_CR52","first-page":"1593","volume":"20","author":"M Weimer","year":"2008","unstructured":"Weimer M, Karatzoglou A, Le Q, Smola A (2008) CoFi $$^{RANK}$$ R A N K -maximum margin matrix factorization for collaborative ranking. Adv Neural Inf Process Syst 20:1593\u20131600","journal-title":"Adv Neural Inf Process Syst"},{"key":"840_CR53","doi-asserted-by":"crossref","unstructured":"Xia F, Liu TY, Wang J, Zhang W, Li H (2008) Listwise approach to learning to rank: theory and algorithm. In: Proceedings of ICML, pp 1192\u20131199","DOI":"10.1145\/1390156.1390306"},{"issue":"4","key":"840_CR54","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/BF00341287","volume":"82","author":"L Younes","year":"1989","unstructured":"Younes L (1989) Parametric inference for imperfectly observed Gibbsian fields. Probab Theory Relat Fields 82(4):625\u2013645","journal-title":"Probab Theory Relat Fields"},{"key":"840_CR55","doi-asserted-by":"crossref","unstructured":"Zhou K, Xue GR, Zha H, Yu Y (2008) Learning to rank with ties. In: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval. ACM, pp 275\u2013282","DOI":"10.1145\/1390334.1390382"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0840-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0840-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0840-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,8]],"date-time":"2024-06-08T23:29:06Z","timestamp":1717889346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0840-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,13]]},"references-count":55,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["840"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0840-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,13]]}}}