{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:25:59Z","timestamp":1740119159923,"version":"3.37.3"},"reference-count":60,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"name":"Ministry of Science, ICT & Future Planning","award":["NRF-2012M3C4A7033342"],"award-info":[{"award-number":["NRF-2012M3C4A7033342"]}]},{"name":"IITP","award":["IITP-2016-H8501-16-1013"],"award-info":[{"award-number":["IITP-2016-H8501-16-1013"]}]},{"DOI":"10.13039\/501100002380","name":"Hanyang University","doi-asserted-by":"publisher","award":["HY-2014-N"],"award-info":[{"award-number":["HY-2014-N"]}],"id":[{"id":"10.13039\/501100002380","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Systems"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1016\/j.is.2016.10.002","type":"journal-article","created":{"date-parts":[[2016,10,20]],"date-time":"2016-10-20T18:35:39Z","timestamp":1476988539000},"page":"7-21","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Latent ranking analysis using pairwise comparisons in crowdsourcing platforms"],"prefix":"10.1016","volume":"65","author":[{"given":"Younghoon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wooyeol","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyuseok","family":"Shim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.is.2016.10.002_bib1","unstructured":"B. Carterette, P.N. Bennett, D.M. Chickering, S.T. Dumais, Here or there: preference judgments for relevance, in: ECIR, 2008."},{"key":"10.1016\/j.is.2016.10.002_bib2","doi-asserted-by":"crossref","unstructured":"X. Chen, P.N. Bennett, K. Collins-Thompson, E. Horvitz, Pairwise ranking aggregation in a crowdsourced setting, in: WSDM, 2013, pp. 193\u2013202.","DOI":"10.1145\/2433396.2433420"},{"year":"2000","series-title":"Large Margin Rank Boundaries for Ordinal Regression","author":"Herbrich","key":"10.1016\/j.is.2016.10.002_bib3"},{"key":"10.1016\/j.is.2016.10.002_bib4","first-page":"933","article-title":"An efficient boosting algorithm for combining preferences","volume":"4","author":"Freund","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.is.2016.10.002_bib5","doi-asserted-by":"crossref","unstructured":"C.J.C. Burges, T. Shaked, E. Renshaw, A. Lazier, M. Deeds, N. Hamilton, G.N. Hullender, Learning to rank using gradient descent, in: ICML, 2005, pp. 89\u201396.","DOI":"10.1145\/1102351.1102363"},{"key":"10.1016\/j.is.2016.10.002_bib6","doi-asserted-by":"crossref","unstructured":"M. Tsai, T. Liu, T. Qin, H. Chen, W. Ma, FRank: a ranking method with fidelity loss, in: SIGIR, 2007.","DOI":"10.1145\/1277741.1277808"},{"key":"10.1016\/j.is.2016.10.002_bib7","doi-asserted-by":"crossref","unstructured":"Z. Zheng, K. Chen, G. Sun, H. Zha, A regression framework for learning ranking functions using relative relevance judgments, in: SIGIR, 2007.","DOI":"10.1145\/1277741.1277792"},{"key":"10.1016\/j.is.2016.10.002_bib8","unstructured":"Z. Zheng, H. Zha, T. Zhang, O. Chapelle, K. Chen, G. Sun, A general boosting method and its application to learning ranking functions for web search, in: NIPS, 2007."},{"issue":"1","key":"10.1016\/j.is.2016.10.002_bib9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s10994-008-5097-z","article-title":"An efficient algorithm for learning to rank from preference graphs","volume":"75","author":"Pahikkala","year":"2009","journal-title":"Mach. Learn."},{"key":"10.1016\/j.is.2016.10.002_bib10","doi-asserted-by":"crossref","unstructured":"M. Amini, T. Truong, C. Goutte, A boosting algorithm for learning bipartite ranking functions with partially labeled data, in: SIGIR, 2008, pp. 99\u2013106.","DOI":"10.1145\/1390334.1390354"},{"issue":"9","key":"10.1016\/j.is.2016.10.002_bib11","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1109\/TNN.2011.2160875","article-title":"Sortnet: learning to rank by a neural preference function","volume":"22","author":"Rigutini","year":"2011","journal-title":"IEEE Trans. Neural Netw."},{"key":"10.1016\/j.is.2016.10.002_bib12","doi-asserted-by":"crossref","unstructured":"T. Joachims, Optimizing search engines using clickthrough data, in: KDD, 2002.","DOI":"10.1145\/775047.775067"},{"key":"10.1016\/j.is.2016.10.002_bib13","doi-asserted-by":"crossref","unstructured":"F. Radlinski, T. Joachims, Active exploration for learning rankings from clickthrough data, in: KDD, 2007.","DOI":"10.1145\/1281192.1281254"},{"issue":"1","key":"10.1016\/j.is.2016.10.002_bib14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/963770.963776","article-title":"Item-based top- recommendation algorithms","volume":"22","author":"Deshpande","year":"2004","journal-title":"ACM Trans. Inf. Syst."},{"key":"10.1016\/j.is.2016.10.002_bib15","doi-asserted-by":"crossref","unstructured":"G. Karypis, Evaluation of item-based top-n recommendation algorithms, in: CIKM, 2001, pp. 247\u2013254.","DOI":"10.1145\/502585.502627"},{"key":"10.1016\/j.is.2016.10.002_bib16","doi-asserted-by":"crossref","unstructured":"B.M. Sarwar, G. Karypis, J.A. Konstan, J. Riedl, Item-based collaborative filtering recommendation algorithms, in: WWW, 2001, pp. 285\u2013295.","DOI":"10.1145\/371920.372071"},{"key":"10.1016\/j.is.2016.10.002_bib17","doi-asserted-by":"crossref","first-page":"421425:1","DOI":"10.1155\/2009\/421425","article-title":"A survey of collaborative filtering techniques","volume":"2009","author":"Su","year":"2009","journal-title":"Adv. Artif. Intell."},{"issue":"3","key":"10.1016\/j.is.2016.10.002_bib18","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1007369909943","article-title":"Learning and revising user profiles:\u00a0the identification of interesting web sites","volume":"27","author":"Pazzani","year":"1997","journal-title":"Mach. Learn."},{"issue":"8","key":"10.1016\/j.is.2016.10.002_bib19","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","article-title":"Matrix factorization techniques for recommender systems","volume":"42","author":"Koren","year":"2009","journal-title":"IEEE Comput."},{"key":"10.1016\/j.is.2016.10.002_bib20","unstructured":"N. Srebro, J.D.M. Rennie, T.S. Jaakkola, Maximum-margin matrix factorization, in: NIPS, 2004, pp. 1329\u20131336."},{"key":"10.1016\/j.is.2016.10.002_bib21","unstructured":"R. Salakhutdinov, A. Mnih, Probabilistic matrix factorization, in: NIPS, 2007."},{"key":"10.1016\/j.is.2016.10.002_bib22","unstructured":"Netflix, \u3008http:\/\/www.netflix.com\u3009."},{"key":"10.1016\/j.is.2016.10.002_bib23","doi-asserted-by":"crossref","unstructured":"T. Hofmann, Latent semantic models for collaborative filtering, ACM Trans. Inf. Syst., 22, 1.","DOI":"10.1145\/963770.963774"},{"key":"10.1016\/j.is.2016.10.002_bib24","doi-asserted-by":"crossref","unstructured":"B. Mehta, T. Hofmann, W. Nejdl, Robust collaborative filtering, in: RecSys, 2007.","DOI":"10.1145\/1297231.1297240"},{"key":"10.1016\/j.is.2016.10.002_bib25","unstructured":"L. Si, R. Jin, Flexible mixture model for collaborative filtering, in: ICML, 2003, pp. 704\u2013711."},{"key":"10.1016\/j.is.2016.10.002_bib26","doi-asserted-by":"crossref","unstructured":"T. Hofmann, Probabilistic latent semantic indexing, in: SIGIR, 1999.","DOI":"10.1145\/312624.312649"},{"key":"10.1016\/j.is.2016.10.002_bib27","first-page":"993","article-title":"Latent dirichlet allocation","volume":"3","author":"Blei","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.is.2016.10.002_bib28","doi-asserted-by":"crossref","unstructured":"D. Agarwal, B.-C. Chen, Regression-based latent factor models, in: KDD, 2009.","DOI":"10.1145\/1557019.1557029"},{"key":"10.1016\/j.is.2016.10.002_bib29","doi-asserted-by":"crossref","unstructured":"D. Agarwal, B.-C. Chen, fLDA: matrix factorization through latent dirichlet allocation, in: WSDM, 2010, pp. 91\u2013100.","DOI":"10.1145\/1718487.1718499"},{"key":"10.1016\/j.is.2016.10.002_bib30","unstructured":"B.M. Marlin, Modeling user rating profiles for collaborative filtering, in: NIPS, 2003, pp. 627\u2013634."},{"key":"10.1016\/j.is.2016.10.002_bib31","doi-asserted-by":"crossref","unstructured":"K. Christakopoulou, A. Banerjee, Collaborative ranking with a push at the top, in: WWW, 2015, pp. 205\u2013215.","DOI":"10.1145\/2736277.2741678"},{"key":"10.1016\/j.is.2016.10.002_bib32","first-page":"933","article-title":"An efficient boosting algorithm for combining preferences","volume":"4","author":"Freund","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.is.2016.10.002_bib33","unstructured":"S. Negahban, S. Oh, D. Shah, Iterative ranking from pair-wise comparisons, in: NIPS, 2012."},{"key":"10.1016\/j.is.2016.10.002_bib34","doi-asserted-by":"crossref","unstructured":"J. Yi, R. Jin, S. Jain, A.K. Jain, Inferring users' preferences from crowdsourced pairwise comparisons: A matrix completion approach, in: HCOMP, 2013.","DOI":"10.1609\/hcomp.v1i1.13084"},{"key":"10.1016\/j.is.2016.10.002_bib35","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1093\/biomet\/44.1-2.114","article-title":"Non-null ranking models","volume":"44","author":"Mallows","year":"1957","journal-title":"Biometrika"},{"key":"10.1016\/j.is.2016.10.002_bib36","first-page":"324","article-title":"Rank analysis of incomplete block designs:\u00a0I. The method of paired comparisons","volume":"39","author":"Bradley","year":"1952","journal-title":"Biometrika"},{"key":"10.1016\/j.is.2016.10.002_bib37","doi-asserted-by":"crossref","unstructured":"Y. Kim, W. Kim, K. Shim, Latent ranking analysis using pairwise comparisons, in: ICDM, 2014, pp. 869\u2013874.","DOI":"10.1109\/ICDM.2014.77"},{"key":"10.1016\/j.is.2016.10.002_bib38","first-page":"1981","article-title":"Mixed membership stochastic blockmodels","volume":"9","author":"Airoldi","year":"2008","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"10.1016\/j.is.2016.10.002_bib39","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/A:1007665907178","article-title":"An introduction to variational methods for graphical models","volume":"37","author":"Jordan","year":"1999","journal-title":"Mach. Learn."},{"key":"10.1016\/j.is.2016.10.002_bib40","doi-asserted-by":"crossref","unstructured":"T.S. Jaakkola, Tutorial on variational approximation methods, in: Advanced Mean Field Methods: Theory and Practice, MIT Press, 2000, pp. 129\u2013159.","DOI":"10.7551\/mitpress\/1100.003.0014"},{"year":"2006","series-title":"Linear Algebra and its Applications","author":"Strang","key":"10.1016\/j.is.2016.10.002_bib41"},{"year":"2007","series-title":"Numerical Recipes 3rd Edition: the Art of Scientific Computing","author":"Press","key":"10.1016\/j.is.2016.10.002_bib42"},{"issue":"2","key":"10.1016\/j.is.2016.10.002_bib43","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1214\/aos\/1176344136","article-title":"Estimating the dimension of a model","volume":"6","author":"Schwarz","year":"1978","journal-title":"Ann. Stat."},{"issue":"2","key":"10.1016\/j.is.2016.10.002_bib44","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1002\/wics.199","article-title":"The bayesian information criterion:\u00a0background, derivation, and applications","volume":"4","author":"Neath","year":"2012","journal-title":"Wiley Interdiscip. Rev.: Comput. Stat."},{"key":"10.1016\/j.is.2016.10.002_bib45","doi-asserted-by":"crossref","unstructured":"D.D. Lewis, W.A. Gale, A sequential algorithm for training text classifiers, in: SIGIR, 1994, pp. 3\u201312.","DOI":"10.1007\/978-1-4471-2099-5_1"},{"key":"10.1016\/j.is.2016.10.002_bib46","unstructured":"B. Settles, Active Earning Literature Survey, Tech. Rep. 1648, University of Wisconsin-Madison, 2010."},{"key":"10.1016\/j.is.2016.10.002_bib47","doi-asserted-by":"crossref","unstructured":"B. Settles, M. Craven, An analysis of active learning strategies for sequence labeling tasks, in: EMNLP, 2008, pp. 1070\u20131079.","DOI":"10.3115\/1613715.1613855"},{"year":"1991","series-title":"Elements of Information Theory","author":"Cover","key":"10.1016\/j.is.2016.10.002_bib48"},{"key":"10.1016\/j.is.2016.10.002_bib49","unstructured":"Wikipedia, Beta Distribution. \u3008http:\/\/en.wikipedia.org\/wiki\/Beta_distribution\u3009, 2014."},{"key":"10.1016\/j.is.2016.10.002_bib50","unstructured":"Wikipedia, Digamma Function. \u3008http:\/\/en.wikipedia.org\/wiki\/Digamma_function\u3009, 2014."},{"key":"10.1016\/j.is.2016.10.002_bib51","unstructured":"K.R. Canini, L. Shi, T.L. Griffiths, Online inference of topics with latent dirichlet allocation, in: AISTATS, 2009."},{"key":"10.1016\/j.is.2016.10.002_bib52","unstructured":"M.D. Hoffman, D.M. Blei, F.R. Bach, Online learning for latent dirichlet allocation, in: NIPS, 2010."},{"key":"10.1016\/j.is.2016.10.002_bib53","unstructured":"Amazon Mechanical Turk. \u3008http:\/\/www.mturk.com\/\u3009, 2014."},{"key":"10.1016\/j.is.2016.10.002_bib54","unstructured":"CrowdFlower. \u3008http:\/\/www.crowdflower.com\/\u3009."},{"key":"10.1016\/j.is.2016.10.002_bib55","doi-asserted-by":"crossref","unstructured":"Y. Koren, Factorization meets the neighborhood: a multifaceted collaborative filtering model, in: SIGKDD, 2008.","DOI":"10.1145\/1401890.1401944"},{"key":"10.1016\/j.is.2016.10.002_bib56","unstructured":"G. Research, Movielens. \u3008http:\/\/grouplens.org\/datasets\/movielens\/\u3009, 2014."},{"key":"10.1016\/j.is.2016.10.002_bib57","unstructured":"Jester. \u3008http:\/\/www.ieor.berkeley.edu\/~goldberg\/jester-data\/\u3009."},{"key":"10.1016\/j.is.2016.10.002_bib58","unstructured":"Y. Webscope, R1 - Yahoo! music user ratings of musical artists, version 1.0. \u3008http:\/\/webscope.sandbox.yahoo.com\/\u3009."},{"issue":"1\/2","key":"10.1016\/j.is.2016.10.002_bib59","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/2332226","article-title":"A new measure of rank correlation","volume":"30","author":"Kendall","year":"1938","journal-title":"Biometrika"},{"issue":"4","key":"10.1016\/j.is.2016.10.002_bib60","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/582415.582418","article-title":"Cumulated gain-based evaluation of ir techniques","volume":"20","author":"J\u00e4rvelin","year":"2002","journal-title":"ACM Trans. Inf. Syst."}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437916304951?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0306437916304951?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T02:48:54Z","timestamp":1718851734000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0306437916304951"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":60,"alternative-id":["S0306437916304951"],"URL":"https:\/\/doi.org\/10.1016\/j.is.2016.10.002","relation":{},"ISSN":["0306-4379"],"issn-type":[{"type":"print","value":"0306-4379"}],"subject":[],"published":{"date-parts":[[2017,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Latent ranking analysis using pairwise comparisons in crowdsourcing platforms","name":"articletitle","label":"Article Title"},{"value":"Information Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.is.2016.10.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}