{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:13:19Z","timestamp":1725585199420},"reference-count":17,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1109\/icassp40776.2020.9054571","type":"proceedings-article","created":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T20:21:13Z","timestamp":1586463673000},"page":"3462-3466","source":"Crossref","is-referenced-by-count":0,"title":["The Picasso Algorithm for Bayesian Localization Via Paired Comparisons in a Union of Subspaces Model"],"prefix":"10.1109","author":[{"given":"Gregory","family":"Canal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marissa","family":"Connor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jihui","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Namrata","family":"Nadagouda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"O'Shaughnessy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher J.","family":"Rozell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark A.","family":"Davenport","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"As you like it: Localization via paired comparisons","author":"massimino","year":"2018","journal-title":"J Mach Learn Res"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.57"},{"key":"ref12","first-page":"2130","article-title":"Leveraging union of subspace structure to improve constrained clustering","author":"lipor","year":"2017","journal-title":"Proceedings of the 34th International Conference on Machine Learning-Volume 70"},{"key":"ref13","first-page":"902","article-title":"Active embedding search via noisy paired comparisons","author":"canal","year":"2019","journal-title":"Proc Int Conf on Machine Learning (ICML)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2009.5470138"},{"article-title":"Learning multiple layers of features from tiny images","year":"2009","author":"krizhevsky","key":"ref15"},{"article-title":"Very deep convolutional networks for large-scale image recognition","year":"2014","author":"simonyan","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP45676.2019.9022446"},{"key":"ref4","article-title":"Active ranking using pairwise comparisons","author":"jamieson","year":"2011","journal-title":"Proc Conf Neural Inf Proc Sys (NeurIPS)"},{"key":"ref3","article-title":"Active learning ranking from pairwise preferences with almost optimal query complexity","author":"ailon","year":"2011","journal-title":"Proc Conf Neural Inf Proc Sys (NeurIPS)"},{"key":"ref6","article-title":"Efficient ranking from pairwise comparisons","author":"wauthier","year":"2013","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref5","article-title":"Iterative ranking from pair-wise comparisons","author":"negahban","year":"2012","journal-title":"Proc Conf Neural Inf Proc Sys (NeurIPS)"},{"key":"ref8","article-title":"Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence","author":"shah","year":"2015","journal-title":"Proc Int Conf Art In-tell Stat (AIStats)"},{"key":"ref7","article-title":"Learning to Top-K search using pairwise comparisons","author":"eriksson","year":"2013","journal-title":"Proc Int Conf Art Intell Stat (AIS-tats)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.08.002"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2017.7953383"},{"key":"ref1","article-title":"Here or there: Preference judgments for relevance","author":"carterette","year":"2008","journal-title":"Proc Eur Conf Inf Retrieval"}],"event":{"name":"ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2020,5,4]]},"location":"Barcelona, Spain","end":{"date-parts":[[2020,5,8]]}},"container-title":["ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9040208\/9052899\/09054571.pdf?arnumber=9054571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T00:14:47Z","timestamp":1656375287000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9054571\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icassp40776.2020.9054571","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}