{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:44:59Z","timestamp":1740138299416,"version":"3.37.3"},"reference-count":54,"publisher":"Informa UK Limited","issue":"6","funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2020,11,1]]},"DOI":"10.1080\/10556788.2019.1584623","type":"journal-article","created":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T17:27:30Z","timestamp":1551461250000},"page":"1119-1143","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Time-homogeneous top-<i>K<\/i> ranking using tensor decompositions"],"prefix":"10.1080","volume":"35","author":[{"given":"Masoud","family":"Ataei","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, York University, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengyuan","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, York University, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zijiang","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Information Technology, York University, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Reza","family":"Peyghami","sequence":"additional","affiliation":[{"name":"School of Information Technology, York University, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2019,3,1]]},"reference":[{"key":"CIT0001","first-page":"137","volume":"13","author":"Ailon N.","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1137\/050623905"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-1471-5"},{"key":"CIT0005","first-page":"817","volume":"59","author":"Andrews D.W.","year":"1991","journal-title":"Econ. J. Econ. Soc."},{"key":"CIT0006","first-page":"502","volume":"41","author":"Bradley R.A.","year":"1954","journal-title":"Biometrika"},{"key":"CIT0007","first-page":"450","volume":"42","author":"Bradley R.A.","year":"1955","journal-title":"Biometrika"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.2307\/2334029"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1214\/12-STS396"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288739"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1037\/h0054245"},{"key":"CIT0012","doi-asserted-by":"crossref","unstructured":"X. Chen, P.N. Bennett, K. Collins-Thompson and E. Horvitz, Pairwise ranking aggregation in a crowdsourced setting, Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, ACM, 2013, pp. 193\u2013202.","DOI":"10.1145\/2433396.2433420"},{"key":"CIT0013","unstructured":"Y. Chen, J. Fan, C. Ma and K. Wang, Spectral method and regularized MLE are both optimal for top-K ranking, 2017. arXiv preprint arXiv:1707.09971."},{"key":"CIT0014","doi-asserted-by":"crossref","unstructured":"X. Chen, S. Gopi, J. Mao and J. Schneider, Competitive analysis of the top-K ranking problem, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2017, pp. 1245\u20131264.","DOI":"10.1137\/1.9781611974782.81"},{"key":"CIT0015","doi-asserted-by":"crossref","unstructured":"X. Chen, Y. Li and J. Mao, A nearly instance optimal algorithm for top-K ranking under the multinomial logit model, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2018, pp. 2504\u20132522.","DOI":"10.1137\/1.9781611975031.160"},{"key":"CIT0016","unstructured":"Y. Chen and C. Suh, Spectral MLE: Top-K rank aggregation from pairwise comparisons, International Conference on Machine Learning, 2015, pp. 371\u2013380."},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1561\/2200000059"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2297439"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1561\/2200000067"},{"key":"CIT0020","unstructured":"R. Clifford and T. Starikovskaya, Approximate Hamming distance in a stream, 2016. arXiv preprint arXiv:1602.07241."},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2298533"},{"key":"CIT0022","doi-asserted-by":"crossref","unstructured":"G. Cormode, M. Datar, P. Indyk and S. Muthukrishnan, Comparing data streams using Hamming norms (how to zero in), VLDB'02: Proceedings of the 28th International Conference on Very Large Databases, Elsevier, 2002, pp. 335\u2013345.","DOI":"10.1016\/B978-155860869-6\/50037-8"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.01.027"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1515\/9780691218632"},{"key":"CIT0025","unstructured":"R. Heckel, N.B. Shah, K. Ramchandran and M.J. Wainwright, Active ranking from pairwise comparisons and when parametric assumptions don't help, 2016. arXiv preprint arXiv:1606.08842."},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1002\/sapm19287139"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2576427"},{"key":"CIT0029","unstructured":"K.G. Jamieson and R. Nowak, Active ranking using pairwise comparisons, Advances in Neural Information Processing Systems, 2011, pp. 2240\u20132248."},{"key":"CIT0030","doi-asserted-by":"crossref","unstructured":"M. Jang, S. Kim, C. Suh and S. Oh, Top-K ranking from pairwise comparisons: When spectral ranking is optimal, 2016. arXiv preprint arXiv:1603.04153.","DOI":"10.1016\/j.neucom.2016.08.029"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4076(92)90104-Y"},{"volume-title":"Individual Choice Behavior","year":"1959","author":"Luce R.D.","key":"CIT0033"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1080\/07350015.1994.10510005"},{"volume-title":"Critical Values for Cointegration Tests","year":"2010","author":"MacKinnon J.G.","key":"CIT0035"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/44.1-2.114"},{"key":"CIT0037","doi-asserted-by":"crossref","unstructured":"S. Mohajer and C. Suh, Active top-K ranking from noisy comparisons, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), IEEE, 2016, pp. 875\u2013882.","DOI":"10.1109\/ALLERTON.2016.7852326"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1534"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1086\/446527"},{"key":"CIT0041","unstructured":"N.B. Shah and M.J. Wainwright, Simple, robust and optimal ranking from pairwise comparisons, 2015. arXiv preprint arXiv:1512.08949."},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1080\/00036849400000034"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1007\/s41109-017-0028-1"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659660"},{"key":"CIT0046","unstructured":"B. Sz\u00f6r\u00e9nyi, R. Busa-Fekete, A. Paul and E. H\u00fcllermeier, Online rank elicitation for Plackett\u2013Luce: A dueling bandits approach, Advances in Neural Information Processing Systems, 2015, pp. 604\u2013612."},{"key":"CIT0047","doi-asserted-by":"publisher","DOI":"10.1037\/h0070288"},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1002\/0471746193"},{"key":"CIT0049","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2503260"},{"key":"CIT0050","doi-asserted-by":"crossref","unstructured":"N. Vervliet, O. Debals and L. De Lathauwer, Tensorlab 3.0-numerical optimization strategies for large-scale constrained and coupled matrix\/tensor factorization, 2016 50th Asilomar Conference on Signals, Systems and Computers, IEEE, 2016, pp. 1733\u20131738.","DOI":"10.1109\/ACSSC.2016.7869679"},{"key":"CIT0051","unstructured":"N. Vervliet, O. Debals and L. De Lathauwer, Canonical polyadic decomposition of incomplete tensors with linearly constrained factors, Technical Report 16\u2013172, ESAT\u2013STADIUS, KU Leuven, Belgium, 2017."},{"key":"CIT0052","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329429"},{"key":"CIT0053","doi-asserted-by":"publisher","DOI":"10.1017\/nws.2016.21"},{"key":"CIT0054","unstructured":"F. Wauthier, M. Jordan and N. Jojic, Efficient ranking from pairwise comparisons, International Conference on Machine Learning, 2013, pp. 109\u2013117."}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2019.1584623","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T02:25:48Z","timestamp":1620354348000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2019.1584623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,1]]},"references-count":54,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,11,1]]}},"alternative-id":["10.1080\/10556788.2019.1584623"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2019.1584623","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"type":"print","value":"1055-6788"},{"type":"electronic","value":"1029-4937"}],"subject":[],"published":{"date-parts":[[2019,3,1]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2018-04-23","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-02-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-03-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}