{"id":"https://openalex.org/W2152001507","doi":"https://doi.org/10.1109/icassp.2011.5946762","title":"Low-rank matrix completion by variational sparse Bayesian learning","display_name":"Low-rank matrix completion by variational sparse Bayesian learning","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2152001507","doi":"https://doi.org/10.1109/icassp.2011.5946762","mag":"2152001507"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2011.5946762","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2011.5946762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107868098","display_name":"S. Derin Babacan","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Derin Babacan","raw_affiliation_strings":["Beckman Institute, University of Illinois, Urbana-Champaign, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beckman Institute, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033484231","display_name":"Martin Luessi","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Luessi","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Northwestern University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Northwestern University, USA","institution_ids":["https://openalex.org/I111979921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023830568","display_name":"Rafael Molina","orcid":"https://orcid.org/0000-0003-4694-8588"},"institutions":[{"id":"https://openalex.org/I173304897","display_name":"Universidad de Granada","ror":"https://ror.org/04njjy449","country_code":"ES","type":"education","lineage":["https://openalex.org/I173304897"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Rafael Molina","raw_affiliation_strings":["Departamento de Ciencias de la Computaci\u00f3n e I.A., Universidad de Granada, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Ciencias de la Computaci\u00f3n e I.A., Universidad de Granada, Spain","institution_ids":["https://openalex.org/I173304897"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048650003","display_name":"Aggelos K. Katsaggelos","orcid":"https://orcid.org/0000-0003-4554-0070"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aggelos K. Katsaggelos","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Northwestern University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Northwestern University, USA","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2188","last_page":"2191"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10688","display_name":"Image and Signal Denoising Methods","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.7675790786743164},{"id":"https://openalex.org/keywords/matrix-completion","display_name":"Matrix completion","score":0.7207267880439758},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6697825789451599},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6100694537162781},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.6046875715255737},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.548265814781189},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5438395738601685},{"id":"https://openalex.org/keywords/learning-to-rank","display_name":"Learning to rank","score":0.5321857929229736},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5028294920921326},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.5016829967498779},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.44562873244285583},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4248570203781128},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41267552971839905},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3893279433250427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27345219254493713},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.19711869955062866},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.16682976484298706}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.7675790786743164},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.7207267880439758},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6697825789451599},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6100694537162781},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.6046875715255737},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.548265814781189},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5438395738601685},{"id":"https://openalex.org/C86037889","wikidata":"https://www.wikidata.org/wiki/Q4330127","display_name":"Learning to rank","level":3,"score":0.5321857929229736},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5028294920921326},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.5016829967498779},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.44562873244285583},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4248570203781128},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41267552971839905},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3893279433250427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27345219254493713},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.19711869955062866},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.16682976484298706},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C25023664","wikidata":"https://www.wikidata.org/wiki/Q1575637","display_name":"Hankel matrix","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/icassp.2011.5946762","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2011.5946762","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.6519","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.6519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://decsai.ugr.es/vip/files/conferences/2011LRmatrixBLMK.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.343.5219","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.343.5219","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ivpl.ece.northwestern.edu/system/files/Babacanicasp2011.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1663973292","https://openalex.org/W1999795676","https://openalex.org/W2000157792","https://openalex.org/W2009086942","https://openalex.org/W2011359124","https://openalex.org/W2047071281","https://openalex.org/W2059283452","https://openalex.org/W2071494625","https://openalex.org/W2089030600","https://openalex.org/W2103972604","https://openalex.org/W2109240917","https://openalex.org/W2117406892","https://openalex.org/W2118550318","https://openalex.org/W2119556711","https://openalex.org/W2124608575","https://openalex.org/W2134332047","https://openalex.org/W2158923808","https://openalex.org/W2535123820","https://openalex.org/W2611328865","https://openalex.org/W2949351217","https://openalex.org/W4285719527","https://openalex.org/W6653445995","https://openalex.org/W6677964101","https://openalex.org/W6683226146","https://openalex.org/W6728872801"],"related_works":["https://openalex.org/W2952489973","https://openalex.org/W2106005123","https://openalex.org/W4300776969","https://openalex.org/W3103289951","https://openalex.org/W2266965707","https://openalex.org/W2108753466","https://openalex.org/W2994409951","https://openalex.org/W2084983808","https://openalex.org/W2906317811","https://openalex.org/W4294691692"],"abstract_inverted_index":{"There":[0],"has":[1],"been":[2,36],"a":[3,43,60,76,89],"significant":[4],"interest":[5],"in":[6,85,100],"the":[7,25,29,48,82,86,102,122],"recovery":[8,40,61,108],"of":[9,15,28,33,124],"low-rank":[10,83],"matrices":[11],"from":[12,75],"an":[13,94],"incomplete":[14],"measurements,":[16],"due":[17],"to":[18],"both":[19],"theoretical":[20],"and":[21,69,80,114],"practical":[22],"developments":[23],"demonstrating":[24],"wide":[26],"applicability":[27],"problem.":[30],"A":[31],"number":[32],"methods":[34,119],"have":[35],"developed":[37],"for":[38,46],"this":[39,56,125],"problem,":[41],"however,":[42],"principled":[44],"method":[45],"choosing":[47],"unknown":[49],"target":[50],"rank":[51,104],"is":[52,97],"generally":[53],"missing.":[54],"In":[55],"paper,":[57],"we":[58,92],"present":[59],"algorithm":[62],"based":[63],"on":[64],"sparse":[65],"Bayesian":[66],"learning":[67],"(SBL)":[68],"automatic":[70],"relevance":[71],"determination":[72],"principles.":[73],"Starting":[74],"matrix":[77],"factorization":[78],"formulation":[79],"enforcing":[81],"constraint":[84],"estimates":[87],"as":[88],"sparsity":[90],"constraint,":[91],"develop":[93],"approach":[95],"that":[96,120],"very":[98],"effective":[99],"determining":[101],"correct":[103],"while":[105],"providing":[106],"high":[107],"performance.":[109],"We":[110],"provide":[111],"empirical":[112],"results":[113],"comparisons":[115],"with":[116],"current":[117],"state-of-the-art":[118],"illustrate":[121],"potential":[123],"approach.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}