{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:15:54Z","timestamp":1776885354502,"version":"3.51.2"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1109\/icassp.2010.5495105","type":"proceedings-article","created":{"date-parts":[[2010,7,6]],"date-time":"2010-07-06T18:17:18Z","timestamp":1278440238000},"page":"2090-2093","source":"Crossref","is-referenced-by-count":6,"title":["A nonparametric Bayesian model for kernel matrix completion"],"prefix":"10.1109","author":[{"given":"John","family":"Paisley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Carin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2018223"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/040\/1059486"},{"key":"ref12","article-title":"Numerical Optimization","author":"nocedal","year":"2006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2024987"},{"key":"ref14","first-page":"67","article-title":"The EM algorithm for kernel matrix completion with auxiliary data","volume":"2","author":"tsuda","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"ref4","article-title":"Exact matrix completion via convex optimization","author":"cand\u00e8s","year":"2008","journal-title":"Foundations of Computational Mathematics"},{"key":"ref3","article-title":"Pattern Recognition and Machine Learning","author":"bishop","year":"2006"},{"key":"ref6","article-title":"Matrix completion with noise","author":"cand\u00e8s","year":"2009","journal-title":"Proc of the IEEE"},{"key":"ref5","author":"cand\u00e8s","year":"2009","journal-title":"The power of convex relaxation Near-optimal matrix completion"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1613\/jair.295","article-title":"Active learning with statistical models","volume":"4","author":"cohn","year":"1996","journal-title":"Journal of Artificial Intelligence Research"},{"key":"ref2","article-title":"Variational Algorithms for Approximate Bayesian Inference","author":"beal","year":"2003","journal-title":"Gatsby Computational Neuroscience Unit University College London"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008655427845"},{"key":"ref9","article-title":"Markov Chain Monte Carlo: Stochastic Simulation for Bayesian Inference","author":"gamerman","year":"2006","journal-title":"Chapman & Hall"}],"event":{"name":"2010 IEEE International Conference on Acoustics, Speech and Signal Processing","location":"Dallas, TX, USA","start":{"date-parts":[[2010,3,14]]},"end":{"date-parts":[[2010,3,19]]}},"container-title":["2010 IEEE International Conference on Acoustics, Speech and Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5487364\/5494886\/05495105.pdf?arnumber=5495105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T20:33:25Z","timestamp":1559248405000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5495105\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icassp.2010.5495105","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}