Clustering is one of the most commonly used data exploration tools, but data often hold interesting geometric structure for which generic clustering objectives are too coarse. Subspace clustering is a simple generalization that tries to fit each cluster with a low-dimensional subspace (ie, each cluster has a low-dimensional covariance structure). This is a very useful model for many problems in computer vision and computer network topology inference. Our group has developed state-of-the-art approaches for subspace clustering when the data matrix is incomplete and in the active clustering context.
Hanno scoperto che nei pazienti affetti da ipertrofia ventricolare sinistra (una condizione in cui il muscolo cardiaco si ispessisce), l’ingrediente del Viagra ha impedito al cuore di ingrandirsi e cambiare forma. Inoltre, il PDE5i ha migliorato la funzione cardiaca privatedelights in tutti i pazienti, indipendentemente dalle loro condizioni mediche, e non ha avuto effetti collaterali sulla pressione sanguigna.
1399621
6JKB3X7P
1
apa
50
date
desc
1
481
http://web.eecs.umich.edu/~girasole/wp-content/plugins/zotpress/
%7B%22status%22%3A%22success%22%2C%22updateneeded%22%3Afalse%2C%22instance%22%3Afalse%2C%22meta%22%3A%7B%22request_last%22%3A0%2C%22request_next%22%3A0%2C%22used_cache%22%3Atrue%7D%2C%22data%22%3A%5B%7B%22key%22%3A%22YKEBU5ZJ%22%2C%22library%22%3A%7B%22id%22%3A1399621%7D%2C%22meta%22%3A%7B%22creatorSummary%22%3A%22Hong%20and%20Balzano%22%2C%22parsedDate%22%3A%222025%22%2C%22numChildren%22%3A0%7D%2C%22bib%22%3A%22%26lt%3Bdiv%20class%3D%26quot%3Bcsl-bib-body%26quot%3B%20style%3D%26quot%3Bline-height%3A%202%3B%20padding-left%3A%201em%3B%20text-indent%3A-1em%3B%26quot%3B%26gt%3B%5Cn%20%20%26lt%3Bdiv%20class%3D%26quot%3Bcsl-entry%26quot%3B%26gt%3BHong%2C%20D.%2C%20%26amp%3B%20Balzano%2C%20L.%20%282025%29.%20Optimal%20sample%20acquisition%20for%20optimally%20weighted%20PCA%20from%20heterogeneous%20quality%20sources.%20%26lt%3Bi%26gt%3BIEEE%20Signal%20Processing%20Letters%26lt%3B%5C%2Fi%26gt%3B%2C%201%26%23x2013%3B5.%20%26lt%3Ba%20class%3D%26%23039%3Bzp-DOIURL%26%23039%3B%20href%3D%26%23039%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1109%5C%2FLSP.2025.3550280%26%23039%3B%26gt%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1109%5C%2FLSP.2025.3550280%26lt%3B%5C%2Fa%26gt%3B%26lt%3B%5C%2Fdiv%26gt%3B%5Cn%26lt%3B%5C%2Fdiv%26gt%3B%22%2C%22data%22%3A%7B%22itemType%22%3A%22journalArticle%22%2C%22title%22%3A%22Optimal%20sample%20acquisition%20for%20optimally%20weighted%20PCA%20from%20heterogeneous%20quality%20sources%22%2C%22creators%22%3A%5B%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22David%22%2C%22lastName%22%3A%22Hong%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Laura%22%2C%22lastName%22%3A%22Balzano%22%7D%5D%2C%22abstractNote%22%3A%22Modern%20high-dimensional%20datasets%20are%20often%20formed%20by%20acquiring%20samples%20from%20multiple%20sources%20having%20heterogeneous%20quality%2C%20i.e.%2C%20some%20sources%20are%20noisier%20than%20others.%20Collecting%20data%20in%20this%20manner%20raises%20the%20following%20natural%20question%3A%20what%20is%20the%20best%20way%20to%20collect%20the%20data%20%28i.e.%2C%20how%20many%20samples%20should%20be%20acquired%20from%20each%20source%29%20given%20constraints%20%28e.g.%2C%20on%20time%20or%20energy%29%3F%20In%20general%2C%20the%20answer%20depends%20on%20what%20analysis%20is%20to%20be%20performed.%20In%20this%20paper%2C%20we%20study%20the%20foundational%20signal%20processing%20task%20of%20estimating%20underlying%20low-dimensional%20principal%20components.%20Since%20the%20resulting%20dataset%20will%20be%20high-dimensional%20and%20will%20have%20heteroscedastic%20noise%2C%20we%20focus%20on%20the%20recently%20proposed%20optimally%20weighted%20PCA%2C%20which%20is%20designed%20specifically%20for%20this%20setting.%20We%20develop%20an%20efficient%20method%20for%20designing%20sample%20acquisitions%20that%20optimize%20the%20asymptotic%20performance%20of%20optimally%20weighted%20PCA%20given%20resource%20constraints%2C%20and%20we%20illustrate%20the%20proposed%20method%20through%20various%20case%20studies.%22%2C%22date%22%3A%222025%22%2C%22section%22%3A%22%22%2C%22partNumber%22%3A%22%22%2C%22partTitle%22%3A%22%22%2C%22DOI%22%3A%2210.1109%5C%2FLSP.2025.3550280%22%2C%22citationKey%22%3A%22%22%2C%22url%22%3A%22https%3A%5C%2F%5C%2Fieeexplore.ieee.org%5C%2Fdocument%5C%2F10921711%22%2C%22PMID%22%3A%22%22%2C%22PMCID%22%3A%22%22%2C%22ISSN%22%3A%221558-2361%22%2C%22language%22%3A%22%22%2C%22collections%22%3A%5B%226JKB3X7P%22%5D%2C%22dateModified%22%3A%222025-03-13T01%3A54%3A27Z%22%7D%7D%2C%7B%22key%22%3A%223WT26UID%22%2C%22library%22%3A%7B%22id%22%3A1399621%7D%2C%22meta%22%3A%7B%22creatorSummary%22%3A%22Lipor%20et%20al.%22%2C%22parsedDate%22%3A%222021-03-16%22%2C%22numChildren%22%3A1%7D%2C%22bib%22%3A%22%26lt%3Bdiv%20class%3D%26quot%3Bcsl-bib-body%26quot%3B%20style%3D%26quot%3Bline-height%3A%202%3B%20padding-left%3A%201em%3B%20text-indent%3A-1em%3B%26quot%3B%26gt%3B%5Cn%20%20%26lt%3Bdiv%20class%3D%26quot%3Bcsl-entry%26quot%3B%26gt%3BLipor%2C%20J.%2C%20Hong%2C%20D.%2C%20Tan%2C%20Y.%20S.%2C%20%26amp%3B%20Balzano%2C%20L.%20%282021%29.%20Subspace%20clustering%20using%20ensembles%20of%20K-subspaces.%20%26lt%3Bi%26gt%3BInformation%20and%20Inference%3A%20A%20Journal%20of%20the%20IMA%26lt%3B%5C%2Fi%26gt%3B%2C%20%26lt%3Bi%26gt%3B10%26lt%3B%5C%2Fi%26gt%3B%281%29%2C%2073%26%23x2013%3B107.%20%26lt%3Ba%20class%3D%26%23039%3Bzp-ItemURL%26%23039%3B%20href%3D%26%23039%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1093%5C%2Fimaiai%5C%2Fiaaa031%26%23039%3B%26gt%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1093%5C%2Fimaiai%5C%2Fiaaa031%26lt%3B%5C%2Fa%26gt%3B%26lt%3B%5C%2Fdiv%26gt%3B%5Cn%26lt%3B%5C%2Fdiv%26gt%3B%22%2C%22data%22%3A%7B%22itemType%22%3A%22journalArticle%22%2C%22title%22%3A%22Subspace%20clustering%20using%20ensembles%20of%20K-subspaces%22%2C%22creators%22%3A%5B%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22John%22%2C%22lastName%22%3A%22Lipor%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22David%22%2C%22lastName%22%3A%22Hong%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Yan%20Shuo%22%2C%22lastName%22%3A%22Tan%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Laura%22%2C%22lastName%22%3A%22Balzano%22%7D%5D%2C%22abstractNote%22%3A%22Subspace%20clustering%20is%20the%20unsupervised%20grouping%20of%20points%20lying%20near%20a%20union%20of%20low-dimensional%20linear%20subspaces.%20Algorithms%20based%20directly%20on%20geometric%20properties%20of%20such%20data%20tend%20to%20either%20provide%20poor%20empirical%20performance%2C%20lack%20theoretical%20guarantees%20or%20depend%20heavily%20on%20their%20initialization.%20We%20present%20a%20novel%20geometric%20approach%20to%20the%20subspace%20clustering%20problem%20that%20leverages%20ensembles%20of%20the%20%24K%24-subspace%20%28KSS%29%20algorithm%20via%20the%20evidence%20accumulation%20clustering%20framework.%20Our%20algorithm%2C%20referred%20to%20as%20ensemble%20%24K%24-subspaces%20%28EKSSs%29%2C%20forms%20a%20co-association%20matrix%20whose%20%24%28i%2Cj%29%24th%20entry%20is%20the%20number%20of%20times%20points%20%24i%24%20and%20%24j%24%20are%20clustered%20together%20by%20several%20runs%20of%20KSS%20with%20random%20initializations.%20We%20prove%20general%20recovery%20guarantees%20for%20any%20algorithm%20that%20forms%20an%20affinity%20matrix%20with%20entries%20close%20to%20a%20monotonic%20transformation%20of%20pairwise%20absolute%20inner%20products.%20We%20then%20show%20that%20a%20specific%20instance%20of%20EKSS%20results%20in%20an%20affinity%20matrix%20with%20entries%20of%20this%20form%2C%20and%20hence%20our%20proposed%20algorithm%20can%20provably%20recover%20subspaces%20under%20similar%20conditions%20to%20state-of-the-art%20algorithms.%20The%20finding%20is%2C%20to%20the%20best%20of%20our%20knowledge%2C%20the%20first%20recovery%20guarantee%20for%20evidence%20accumulation%20clustering%20and%20for%20KSS%20variants.%20We%20show%20on%20synthetic%20data%20that%20our%20method%20performs%20well%20in%20the%20traditionally%20challenging%20settings%20of%20subspaces%20with%20large%20intersection%2C%20subspaces%20with%20small%20principal%20angles%20and%20noisy%20data.%20Finally%2C%20we%20evaluate%20our%20algorithm%20on%20six%20common%20benchmark%20datasets%20and%20show%20that%20unlike%20existing%20methods%2C%20EKSS%20achieves%20excellent%20empirical%20performance%20when%20there%20are%20both%20a%20small%20and%20large%20number%20of%20points%20per%20subspace.%22%2C%22date%22%3A%22March%2016%2C%202021%22%2C%22section%22%3A%22%22%2C%22partNumber%22%3A%22%22%2C%22partTitle%22%3A%22%22%2C%22DOI%22%3A%2210.1093%5C%2Fimaiai%5C%2Fiaaa031%22%2C%22citationKey%22%3A%22%22%2C%22url%22%3A%22https%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1093%5C%2Fimaiai%5C%2Fiaaa031%22%2C%22PMID%22%3A%22%22%2C%22PMCID%22%3A%22%22%2C%22ISSN%22%3A%222049-8772%22%2C%22language%22%3A%22%22%2C%22collections%22%3A%5B%22DZFDBB6V%22%2C%22427SEM27%22%2C%226JKB3X7P%22%2C%22HJQ26QYG%22%5D%2C%22dateModified%22%3A%222021-03-16T15%3A37%3A52Z%22%7D%7D%2C%7B%22key%22%3A%22T9FXM6GF%22%2C%22library%22%3A%7B%22id%22%3A1399621%7D%2C%22meta%22%3A%7B%22creatorSummary%22%3A%22Lipor%20and%20Balzano%22%2C%22parsedDate%22%3A%222020-03-13%22%2C%22numChildren%22%3A2%7D%2C%22bib%22%3A%22%26lt%3Bdiv%20class%3D%26quot%3Bcsl-bib-body%26quot%3B%20style%3D%26quot%3Bline-height%3A%202%3B%20padding-left%3A%201em%3B%20text-indent%3A-1em%3B%26quot%3B%26gt%3B%5Cn%20%20%26lt%3Bdiv%20class%3D%26quot%3Bcsl-entry%26quot%3B%26gt%3BLipor%2C%20J.%2C%20%26amp%3B%20Balzano%2C%20L.%20%282020%29.%20Clustering%20quality%20metrics%20for%20subspace%20clustering.%20%26lt%3Bi%26gt%3BPattern%20Recognition%26lt%3B%5C%2Fi%26gt%3B%2C%20107328.%20%26lt%3Ba%20class%3D%26%23039%3Bzp-DOIURL%26%23039%3B%20href%3D%26%23039%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1016%5C%2Fj.patcog.2020.107328%26%23039%3B%26gt%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1016%5C%2Fj.patcog.2020.107328%26lt%3B%5C%2Fa%26gt%3B%26lt%3B%5C%2Fdiv%26gt%3B%5Cn%26lt%3B%5C%2Fdiv%26gt%3B%22%2C%22data%22%3A%7B%22itemType%22%3A%22journalArticle%22%2C%22title%22%3A%22Clustering%20quality%20metrics%20for%20subspace%20clustering%22%2C%22creators%22%3A%5B%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22John%22%2C%22lastName%22%3A%22Lipor%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Laura%22%2C%22lastName%22%3A%22Balzano%22%7D%5D%2C%22abstractNote%22%3A%22We%20study%20the%20problem%20of%20clustering%20validation%2C%20i.e.%2C%20clustering%20evaluation%20without%20knowledge%20of%20ground-truth%20labels%2C%20for%20the%20increasingly-popular%20framework%20known%20as%20subspace%20clustering.%20Existing%20clustering%20quality%20metrics%20%28CQMs%29%20rely%20heavily%20on%20a%20notion%20of%20distance%20between%20points%2C%20but%20common%20metrics%20fail%20to%20capture%20the%20geometry%20of%20subspace%20clustering.%20We%20propose%20a%20novel%20point-to-point%20pseudometric%20for%20points%20lying%20on%20a%20union%20of%20subspaces%20and%20show%20how%20this%20allows%20for%20the%20application%20of%20existing%20CQMs%20to%20the%20subspace%20clustering%20problem.%20We%20provide%20theoretical%20and%20empirical%20justification%20for%20the%20proposed%20point-to-point%20distance%2C%20and%20then%20demonstrate%20on%20a%20number%20of%20common%20benchmark%20datasets%20that%20our%20proposed%20methods%20generally%20outperform%20existing%20graph-based%20CQMs%20in%20terms%20of%20choosing%20the%20best%20clustering%20and%20the%20number%20of%20clusters.%22%2C%22date%22%3A%22March%2013%2C%202020%22%2C%22section%22%3A%22%22%2C%22partNumber%22%3A%22%22%2C%22partTitle%22%3A%22%22%2C%22DOI%22%3A%2210.1016%5C%2Fj.patcog.2020.107328%22%2C%22citationKey%22%3A%22%22%2C%22url%22%3A%22http%3A%5C%2F%5C%2Fwww.sciencedirect.com%5C%2Fscience%5C%2Farticle%5C%2Fpii%5C%2FS003132032030131X%22%2C%22PMID%22%3A%22%22%2C%22PMCID%22%3A%22%22%2C%22ISSN%22%3A%220031-3203%22%2C%22language%22%3A%22en%22%2C%22collections%22%3A%5B%22DZFDBB6V%22%2C%22427SEM27%22%2C%226JKB3X7P%22%5D%2C%22dateModified%22%3A%222020-03-13T21%3A48%3A31Z%22%7D%7D%2C%7B%22key%22%3A%223D4RNA88%22%2C%22library%22%3A%7B%22id%22%3A1399621%7D%2C%22meta%22%3A%7B%22creatorSummary%22%3A%22Pimentel-Alarc%5Cu00f3n%20et%20al.%22%2C%22parsedDate%22%3A%222017-10%22%2C%22numChildren%22%3A1%7D%2C%22bib%22%3A%22%26lt%3Bdiv%20class%3D%26quot%3Bcsl-bib-body%26quot%3B%20style%3D%26quot%3Bline-height%3A%202%3B%20padding-left%3A%201em%3B%20text-indent%3A-1em%3B%26quot%3B%26gt%3B%5Cn%20%20%26lt%3Bdiv%20class%3D%26quot%3Bcsl-entry%26quot%3B%26gt%3BPimentel-Alarc%26%23xF3%3Bn%2C%20D.%2C%20Ongie%2C%20G.%2C%20Balzano%2C%20L.%2C%20Willett%2C%20R.%2C%20%26amp%3B%20Nowak%2C%20R.%20%282017%29.%20Low%20algebraic%20dimension%20matrix%20completion.%20%26lt%3Bi%26gt%3B2017%2055th%20Annual%20Allerton%20Conference%20on%20Communication%2C%20Control%2C%20and%20Computing%20%28Allerton%29%26lt%3B%5C%2Fi%26gt%3B%2C%20790%26%23x2013%3B797.%20%26lt%3Ba%20class%3D%26%23039%3Bzp-DOIURL%26%23039%3B%20href%3D%26%23039%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1109%5C%2FALLERTON.2017.8262820%26%23039%3B%26gt%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1109%5C%2FALLERTON.2017.8262820%26lt%3B%5C%2Fa%26gt%3B%26lt%3B%5C%2Fdiv%26gt%3B%5Cn%26lt%3B%5C%2Fdiv%26gt%3B%22%2C%22data%22%3A%7B%22itemType%22%3A%22conferencePaper%22%2C%22title%22%3A%22Low%20algebraic%20dimension%20matrix%20completion%22%2C%22creators%22%3A%5B%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22D.%22%2C%22lastName%22%3A%22Pimentel-Alarc%5Cu00f3n%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22G.%22%2C%22lastName%22%3A%22Ongie%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22L.%22%2C%22lastName%22%3A%22Balzano%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22R.%22%2C%22lastName%22%3A%22Willett%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22R.%22%2C%22lastName%22%3A%22Nowak%22%7D%5D%2C%22abstractNote%22%3A%22Low%20rank%20matrix%20completion%20%28LRMC%29%20has%20received%20tremendous%20attention%20in%20recent%20years.%20The%20low%20rank%20assumption%20means%20that%20the%20columns%20%28or%20rows%29%20of%20the%20matrix%20to%20be%20completed%20are%20points%20on%20a%20low-dimensional%20linear%20variety.%20This%20paper%20extends%20this%20thinking%20to%20cases%20where%20the%20columns%20are%20points%20on%20low-dimensional%20nonlinear%20algebraic%20varieties.%20While%20others%20have%20recently%20studied%20matrix%20completion%20in%20such%20settings%2C%20existing%20results%20focus%20mainly%20on%20algorithms%20and%20experiments%2C%20without%20supporting%20theory.%20This%20paper%20proposes%20a%20new%20approach%20to%20what%20we%20call%20Low%20Algebraic-Dimension%20Matrix%20Completion%20%28LADMC%29.%20We%20propose%20a%20new%20LADMC%20algorithm%20that%20leverages%20existing%20LRMC%20methods%20on%20a%20tensorized%20representation%20of%20the%20data.%20We%20also%20provide%20a%20formal%20mathematical%20justification%20for%20the%20success%20of%20our%20method.%20In%20particular%2C%20the%20new%20algorithm%20can%20succeed%20in%20many%20cases%20where%20traditional%20LRMC%20is%20guaranteed%20to%20fail.%20We%20also%20provide%20experimental%20results%20showing%20that%20the%20new%20approach%20significantly%20outperforms%20existing%20state-of-the-art%20methods%20for%20matrix%20completion%20in%20many%20situations.%22%2C%22proceedingsTitle%22%3A%222017%2055th%20Annual%20Allerton%20Conference%20on%20Communication%2C%20Control%2C%20and%20Computing%20%28Allerton%29%22%2C%22conferenceName%22%3A%222017%2055th%20Annual%20Allerton%20Conference%20on%20Communication%2C%20Control%2C%20and%20Computing%20%28Allerton%29%22%2C%22date%22%3A%22October%202017%22%2C%22DOI%22%3A%2210.1109%5C%2FALLERTON.2017.8262820%22%2C%22ISBN%22%3A%22%22%2C%22citationKey%22%3A%22%22%2C%22url%22%3A%22%22%2C%22ISSN%22%3A%22%22%2C%22language%22%3A%22%22%2C%22collections%22%3A%5B%22DZFDBB6V%22%2C%22WUTP7CH6%22%2C%22ZA8QMDGD%22%2C%226JKB3X7P%22%5D%2C%22dateModified%22%3A%222018-02-16T18%3A27%3A05Z%22%7D%7D%2C%7B%22key%22%3A%22KP7GFVDR%22%2C%22library%22%3A%7B%22id%22%3A1399621%7D%2C%22meta%22%3A%7B%22creatorSummary%22%3A%22Pimentel-Alarc%5Cu00f3n%20et%20al.%22%2C%22parsedDate%22%3A%222017-07%22%2C%22numChildren%22%3A2%7D%2C%22bib%22%3A%22%26lt%3Bdiv%20class%3D%26quot%3Bcsl-bib-body%26quot%3B%20style%3D%26quot%3Bline-height%3A%202%3B%20padding-left%3A%201em%3B%20text-indent%3A-1em%3B%26quot%3B%26gt%3B%5Cn%20%20%26lt%3Bdiv%20class%3D%26quot%3Bcsl-entry%26quot%3B%26gt%3BPimentel-Alarc%26%23xF3%3Bn%2C%20D.%2C%20Balzano%2C%20L.%2C%20Marcia%2C%20R.%2C%20Nowak%2C%20R.%2C%20%26amp%3B%20Willett%2C%20R.%20%282017%29.%20Mixture%20regression%20as%20subspace%20clustering.%20%26lt%3Bi%26gt%3B2017%20International%20Conference%20on%20Sampling%20Theory%20and%20Applications%20%28SampTA%29%26lt%3B%5C%2Fi%26gt%3B%2C%20456%26%23x2013%3B459.%20%26lt%3Ba%20class%3D%26%23039%3Bzp-DOIURL%26%23039%3B%20href%3D%26%23039%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1109%5C%2FSAMPTA.2017.8024386%26%23039%3B%26gt%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1109%5C%2FSAMPTA.2017.8024386%26lt%3B%5C%2Fa%26gt%3B%26lt%3B%5C%2Fdiv%26gt%3B%5Cn%26lt%3B%5C%2Fdiv%26gt%3B%22%2C%22data%22%3A%7B%22itemType%22%3A%22conferencePaper%22%2C%22title%22%3A%22Mixture%20regression%20as%20subspace%20clustering%22%2C%22creators%22%3A%5B%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22D.%22%2C%22lastName%22%3A%22Pimentel-Alarc%5Cu00f3n%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22L.%22%2C%22lastName%22%3A%22Balzano%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22R.%22%2C%22lastName%22%3A%22Marcia%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22R.%22%2C%22lastName%22%3A%22Nowak%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22R.%22%2C%22lastName%22%3A%22Willett%22%7D%5D%2C%22abstractNote%22%3A%22In%20this%20paper%20we%20show%20that%20observations%20in%20a%20mixture%20can%20be%20modeled%20using%20a%20union%20of%20subspaces%2C%20and%20hence%20mixture%20regression%20can%20be%20posed%20as%20a%20subspace%20clustering%20problem.%20This%20allows%20to%20perform%20mixture%20regression%20even%20in%20the%20presence%20of%20missing%20data.%20We%20illustrate%20this%20using%20a%20state-of-the-art%20subspace%20clustering%20algorithm%20for%20incomplete%20data%20to%20perform%20mixed%20linear%20regression%20on%20gene%20functional%20data.%20Our%20approach%20outperforms%20existing%20methods%20on%20this%20task.%22%2C%22proceedingsTitle%22%3A%222017%20International%20Conference%20on%20Sampling%20Theory%20and%20Applications%20%28SampTA%29%22%2C%22conferenceName%22%3A%222017%20International%20Conference%20on%20Sampling%20Theory%20and%20Applications%20%28SampTA%29%22%2C%22date%22%3A%22July%202017%22%2C%22DOI%22%3A%2210.1109%5C%2FSAMPTA.2017.8024386%22%2C%22ISBN%22%3A%22%22%2C%22citationKey%22%3A%22%22%2C%22url%22%3A%22%22%2C%22ISSN%22%3A%22%22%2C%22language%22%3A%22%22%2C%22collections%22%3A%5B%22DZFDBB6V%22%2C%22ZA8QMDGD%22%2C%226JKB3X7P%22%5D%2C%22dateModified%22%3A%222017-09-08T10%3A23%3A22Z%22%7D%7D%2C%7B%22key%22%3A%225KU92TTX%22%2C%22library%22%3A%7B%22id%22%3A1399621%7D%2C%22meta%22%3A%7B%22creatorSummary%22%3A%22Pimentel-Alarc%5Cu00f3n%20et%20al.%22%2C%22parsedDate%22%3A%222016-06%22%2C%22numChildren%22%3A1%7D%2C%22bib%22%3A%22%26lt%3Bdiv%20class%3D%26quot%3Bcsl-bib-body%26quot%3B%20style%3D%26quot%3Bline-height%3A%202%3B%20padding-left%3A%201em%3B%20text-indent%3A-1em%3B%26quot%3B%26gt%3B%5Cn%20%20%26lt%3Bdiv%20class%3D%26quot%3Bcsl-entry%26quot%3B%26gt%3BPimentel-Alarc%26%23xF3%3Bn%2C%20D.%2C%20Balzano%2C%20L.%2C%20Marcia%2C%20R.%2C%20Nowak%2C%20R.%2C%20%26amp%3B%20Willett%2C%20R.%20%282016%29.%20Group-sparse%20subspace%20clustering%20with%20missing%20data.%20%26lt%3Bi%26gt%3B2016%20IEEE%20Statistical%20Signal%20Processing%20Workshop%20%28SSP%29%26lt%3B%5C%2Fi%26gt%3B%2C%201%26%23x2013%3B5.%20%26lt%3Ba%20class%3D%26%23039%3Bzp-DOIURL%26%23039%3B%20href%3D%26%23039%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1109%5C%2FSSP.2016.7551734%26%23039%3B%26gt%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1109%5C%2FSSP.2016.7551734%26lt%3B%5C%2Fa%26gt%3B%26lt%3B%5C%2Fdiv%26gt%3B%5Cn%26lt%3B%5C%2Fdiv%26gt%3B%22%2C%22data%22%3A%7B%22itemType%22%3A%22conferencePaper%22%2C%22title%22%3A%22Group-sparse%20subspace%20clustering%20with%20missing%20data%22%2C%22creators%22%3A%5B%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22D.%22%2C%22lastName%22%3A%22Pimentel-Alarc%5Cu00f3n%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22L.%22%2C%22lastName%22%3A%22Balzano%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22R.%22%2C%22lastName%22%3A%22Marcia%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22R.%22%2C%22lastName%22%3A%22Nowak%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22R.%22%2C%22lastName%22%3A%22Willett%22%7D%5D%2C%22abstractNote%22%3A%22This%20paper%20explores%20algorithms%20for%20subspace%20clustering%20with%20missing%20data.%20In%20many%20high-dimensional%20data%20analysis%20settings%2C%20data%20points%20Lie%20in%20or%20near%20a%20union%20of%20subspaces.%20Subspace%20clustering%20is%20the%20process%20of%20estimating%20these%20subspaces%20and%20assigning%20each%20data%20point%20to%20one%20of%20them.%20However%2C%20in%20many%20modern%20applications%20the%20data%20are%20severely%20corrupted%20by%20missing%20values.%20This%20paper%20describes%20two%20novel%20methods%20for%20subspace%20clustering%20with%20missing%20data%3A%20%28a%29%20group-sparse%20sub-space%20clustering%20%28GSSC%29%2C%20which%20is%20based%20on%20group-sparsity%20and%20alternating%20minimization%2C%20and%20%28b%29%20mixture%20subspace%20clustering%20%28MSC%29%2C%20which%20models%20each%20data%20point%20as%20a%20convex%20combination%20of%20its%20projections%20onto%20all%20subspaces%20in%20the%20union.%20Both%20of%20these%20algorithms%20are%20shown%20to%20converge%20to%20a%20local%20minimum%2C%20and%20experimental%20results%20show%20that%20they%20outperform%20the%20previous%20state-of-the-art%2C%20with%20GSSC%20yielding%20the%20highest%20overall%20clustering%20accuracy.%22%2C%22proceedingsTitle%22%3A%222016%20IEEE%20Statistical%20Signal%20Processing%20Workshop%20%28SSP%29%22%2C%22conferenceName%22%3A%222016%20IEEE%20Statistical%20Signal%20Processing%20Workshop%20%28SSP%29%22%2C%22date%22%3A%22June%202016%22%2C%22DOI%22%3A%2210.1109%5C%2FSSP.2016.7551734%22%2C%22ISBN%22%3A%22%22%2C%22citationKey%22%3A%22%22%2C%22url%22%3A%22%22%2C%22ISSN%22%3A%22%22%2C%22language%22%3A%22%22%2C%22collections%22%3A%5B%22DZFDBB6V%22%2C%22WUTP7CH6%22%2C%226JKB3X7P%22%5D%2C%22dateModified%22%3A%222024-06-25T14%3A33%3A15Z%22%7D%7D%2C%7B%22key%22%3A%22BHWNWAUV%22%2C%22library%22%3A%7B%22id%22%3A1399621%7D%2C%22meta%22%3A%7B%22creatorSummary%22%3A%22Pimentel-Alarc%5Cu00f3n%20et%20al.%22%2C%22parsedDate%22%3A%222016%22%2C%22numChildren%22%3A3%7D%2C%22bib%22%3A%22%26lt%3Bdiv%20class%3D%26quot%3Bcsl-bib-body%26quot%3B%20style%3D%26quot%3Bline-height%3A%202%3B%20padding-left%3A%201em%3B%20text-indent%3A-1em%3B%26quot%3B%26gt%3B%5Cn%20%20%26lt%3Bdiv%20class%3D%26quot%3Bcsl-entry%26quot%3B%26gt%3BPimentel-Alarc%26%23xF3%3Bn%2C%20D.%2C%20Balzano%2C%20L.%2C%20%26amp%3B%20Nowak%2C%20R.%20%282016%29.%20Necessary%20and%20sufficient%20conditions%20for%20sketched%20subspace%20clustering.%20%26lt%3Bi%26gt%3BAllerton%20Conference%20on%20Communication%2C%20Control%2C%20and%20Computing%26lt%3B%5C%2Fi%26gt%3B.%20%26lt%3Ba%20class%3D%26%23039%3Bzp-ItemURL%26%23039%3B%20href%3D%26%23039%3Bhttps%3A%5C%2F%5C%2Fdanielpimentel.github.io%5C%2Fpdfs%5C%2FsketchedSC.pdf%26%23039%3B%26gt%3Bhttps%3A%5C%2F%5C%2Fdanielpimentel.github.io%5C%2Fpdfs%5C%2FsketchedSC.pdf%26lt%3B%5C%2Fa%26gt%3B%26lt%3B%5C%2Fdiv%26gt%3B%5Cn%26lt%3B%5C%2Fdiv%26gt%3B%22%2C%22data%22%3A%7B%22itemType%22%3A%22conferencePaper%22%2C%22title%22%3A%22Necessary%20and%20sufficient%20conditions%20for%20sketched%20subspace%20clustering%22%2C%22creators%22%3A%5B%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Daniel%22%2C%22lastName%22%3A%22Pimentel-Alarc%5Cu00f3n%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Laura%22%2C%22lastName%22%3A%22Balzano%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Robert%22%2C%22lastName%22%3A%22Nowak%22%7D%5D%2C%22abstractNote%22%3A%22%22%2C%22proceedingsTitle%22%3A%22Allerton%20Conference%20on%20Communication%2C%20Control%2C%20and%20Computing%22%2C%22conferenceName%22%3A%22%22%2C%22date%22%3A%222016%22%2C%22DOI%22%3A%22%22%2C%22ISBN%22%3A%22%22%2C%22citationKey%22%3A%22%22%2C%22url%22%3A%22https%3A%5C%2F%5C%2Fdanielpimentel.github.io%5C%2Fpdfs%5C%2FsketchedSC.pdf%22%2C%22ISSN%22%3A%22%22%2C%22language%22%3A%22%22%2C%22collections%22%3A%5B%22DZFDBB6V%22%2C%226JKB3X7P%22%5D%2C%22dateModified%22%3A%222024-06-25T14%3A33%3A37Z%22%7D%7D%2C%7B%22key%22%3A%2278Q9AHXX%22%2C%22library%22%3A%7B%22id%22%3A1399621%7D%2C%22meta%22%3A%7B%22creatorSummary%22%3A%22Lipor%20and%20Balzano%22%2C%22parsedDate%22%3A%222015-12%22%2C%22numChildren%22%3A2%7D%2C%22bib%22%3A%22%26lt%3Bdiv%20class%3D%26quot%3Bcsl-bib-body%26quot%3B%20style%3D%26quot%3Bline-height%3A%202%3B%20padding-left%3A%201em%3B%20text-indent%3A-1em%3B%26quot%3B%26gt%3B%5Cn%20%20%26lt%3Bdiv%20class%3D%26quot%3Bcsl-entry%26quot%3B%26gt%3BLipor%2C%20J.%2C%20%26amp%3B%20Balzano%2C%20L.%20%282015%29.%20Margin-based%20active%20subspace%20clustering.%20%26lt%3Bi%26gt%3B2015%20IEEE%206th%20International%20Workshop%20on%20Computational%20Advances%20in%20Multi-Sensor%20Adaptive%20Processing%20%28CAMSAP%29%26lt%3B%5C%2Fi%26gt%3B%2C%20377%26%23x2013%3B380.%20%26lt%3Ba%20class%3D%26%23039%3Bzp-DOIURL%26%23039%3B%20href%3D%26%23039%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1109%5C%2FCAMSAP.2015.7383815%26%23039%3B%26gt%3Bhttps%3A%5C%2F%5C%2Fdoi.org%5C%2F10.1109%5C%2FCAMSAP.2015.7383815%26lt%3B%5C%2Fa%26gt%3B%26lt%3B%5C%2Fdiv%26gt%3B%5Cn%26lt%3B%5C%2Fdiv%26gt%3B%22%2C%22data%22%3A%7B%22itemType%22%3A%22conferencePaper%22%2C%22title%22%3A%22Margin-based%20active%20subspace%20clustering%22%2C%22creators%22%3A%5B%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22J.%22%2C%22lastName%22%3A%22Lipor%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22L.%22%2C%22lastName%22%3A%22Balzano%22%7D%5D%2C%22abstractNote%22%3A%22Subspace%20clustering%20has%20typically%20been%20approached%20as%20an%20unsupervised%20machine%20learning%20problem.%20However%20in%20several%20applications%20where%20the%20union%20of%20subspaces%20model%20is%20useful%2C%20it%20is%20also%20reasonable%20to%20assume%20you%20have%20access%20to%20a%20small%20number%20of%20labels.%20In%20this%20paper%20we%20investigate%20the%20benefit%20labeled%20data%20brings%20to%20the%20subspace%20clustering%20problem.%20We%20focus%20on%20incorporating%20labels%20into%20the%20k-subspaces%20algorithm%2C%20a%20simple%20and%20computationally%20efficient%20alternating%20estimation%20algorithm.%20We%20find%20that%20even%20a%20very%20small%20number%20of%20randomly%20selected%20labels%20can%20greatly%20improve%20accuracy%20over%20the%20unsupervised%20approach.%20We%20demonstrate%20that%20with%20enough%20labels%2C%20we%20get%20a%20significant%20improvement%20by%20using%20actively%20selected%20labels%20chosen%20for%20points%20that%20are%20nearly%20equidistant%20to%20more%20than%20one%20estimated%20subspace.%20We%20show%20this%20improvement%20on%20simulated%20data%20and%20face%20images.%22%2C%22proceedingsTitle%22%3A%222015%20IEEE%206th%20International%20Workshop%20on%20Computational%20Advances%20in%20Multi-Sensor%20Adaptive%20Processing%20%28CAMSAP%29%22%2C%22conferenceName%22%3A%222015%20IEEE%206th%20International%20Workshop%20on%20Computational%20Advances%20in%20Multi-Sensor%20Adaptive%20Processing%20%28CAMSAP%29%22%2C%22date%22%3A%22December%202015%22%2C%22DOI%22%3A%2210.1109%5C%2FCAMSAP.2015.7383815%22%2C%22ISBN%22%3A%22%22%2C%22citationKey%22%3A%22%22%2C%22url%22%3A%22ieeexplore.ieee.org%5C%2Fxpl%5C%2FarticleDetails.jsp%3Farnumber%3D7383815%22%2C%22ISSN%22%3A%22%22%2C%22language%22%3A%22%22%2C%22collections%22%3A%5B%22DZFDBB6V%22%2C%22ZA8QMDGD%22%2C%226JKB3X7P%22%2C%22E36HLPSJ%22%5D%2C%22dateModified%22%3A%222016-06-13T15%3A59%3A42Z%22%7D%7D%2C%7B%22key%22%3A%224SRUMQNM%22%2C%22library%22%3A%7B%22id%22%3A1399621%7D%2C%22meta%22%3A%7B%22creatorSummary%22%3A%22Pimentel%20et%20al.%22%2C%22parsedDate%22%3A%222014-06%22%2C%22numChildren%22%3A2%7D%2C%22bib%22%3A%22%26lt%3Bdiv%20class%3D%26quot%3Bcsl-bib-body%26quot%3B%20style%3D%26quot%3Bline-height%3A%202%3B%20padding-left%3A%201em%3B%20text-indent%3A-1em%3B%26quot%3B%26gt%3B%5Cn%20%20%26lt%3Bdiv%20class%3D%26quot%3Bcsl-entry%26quot%3B%26gt%3BPimentel%2C%20D.%2C%20Nowak%2C%20R.%2C%20%26amp%3B%20Balzano%2C%20L.%20%282014%29.%20On%20the%20sample%20complexity%20of%20subspace%20clustering%20with%20missing%20data.%20%26lt%3Bi%26gt%3B2014%20IEEE%20Workshop%20on%20Statistical%20Signal%20Processing%20%28SSP%29%26lt%3B%5C%2Fi%26gt%3B%2C%20280%26%23x2013%3B283.%20%26lt%3Ba%20class%3D%26%23039%3Bzp-ItemURL%26%23039%3B%20href%3D%26%23039%3Bhttp%3A%5C%2F%5C%2Fieeexplore.ieee.org%5C%2Fxpl%5C%2FarticleDetails.jsp%3Farnumber%3D6884630%26%23039%3B%26gt%3Bhttp%3A%5C%2F%5C%2Fieeexplore.ieee.org%5C%2Fxpl%5C%2FarticleDetails.jsp%3Farnumber%3D6884630%26lt%3B%5C%2Fa%26gt%3B%26lt%3B%5C%2Fdiv%26gt%3B%5Cn%26lt%3B%5C%2Fdiv%26gt%3B%22%2C%22data%22%3A%7B%22itemType%22%3A%22conferencePaper%22%2C%22title%22%3A%22On%20the%20sample%20complexity%20of%20subspace%20clustering%20with%20missing%20data%22%2C%22creators%22%3A%5B%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22D.%22%2C%22lastName%22%3A%22Pimentel%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22R.%22%2C%22lastName%22%3A%22Nowak%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22L.%22%2C%22lastName%22%3A%22Balzano%22%7D%5D%2C%22abstractNote%22%3A%22Subspace%20clustering%20is%20a%20useful%20tool%20for%20analyzing%20large%20complex%20data%2C%20but%20in%20many%20relevant%20applications%20missing%20data%20are%20common.%20Existing%20theoretical%20analysis%20of%20this%20problem%20shows%20that%20subspace%20clustering%20from%20incomplete%20data%20is%20possible%2C%20but%20that%20analysis%20requires%20the%20number%20of%20samples%20%28i.e.%2C%20partially%20observed%20vectors%29%20to%20be%20super-polynomial%20in%20the%20dimension%20d.%20Such%20huge%20sample%20sizes%20are%20unnecessary%20when%20no%20data%20are%20missing%20and%20uncommon%20in%20applications.%20There%20are%20two%20main%20contributions%20in%20this%20paper.%20First%2C%20it%20is%20shown%20that%20if%20subspaces%20have%20rank%20at%20most%20r%20and%20the%20number%20of%20partially%20observed%20vectors%20greater%20than%20dr%2B1%20%28times%20a%20poly-logarithmic%20factor%29%2C%20then%20with%20high%20probability%20the%20true%20subspaces%20are%20the%20only%20subspaces%20that%20agree%20with%20the%20observed%20data.%20We%20may%20conclude%20that%20subspace%20clustering%20may%20be%20possible%20without%20impractically%20large%20sample%20sizes%20and%20that%20we%20can%20certify%20the%20output%20of%20any%20subspace%20clustering%20algorithm%20by%20checking%20its%20fit%20to%20the%20observed%20data.%20The%20second%20main%20contribution%20is%20a%20novel%20EM-type%20algorithm%20for%20subspace%20clustering%20with%20missing%20data.%20We%20demonstrate%20and%20compare%20it%20to%20several%20other%20algorithms.%20Experiments%20with%20simulated%20and%20real%20data%20show%20that%20such%20algorithms%20work%20well%20in%20practice.%22%2C%22proceedingsTitle%22%3A%222014%20IEEE%20Workshop%20on%20Statistical%20Signal%20Processing%20%28SSP%29%22%2C%22conferenceName%22%3A%222014%20IEEE%20Workshop%20on%20Statistical%20Signal%20Processing%20%28SSP%29%22%2C%22date%22%3A%22June%202014%22%2C%22DOI%22%3A%22%22%2C%22ISBN%22%3A%22%22%2C%22citationKey%22%3A%22%22%2C%22url%22%3A%22http%3A%5C%2F%5C%2Fieeexplore.ieee.org%5C%2Fxpl%5C%2FarticleDetails.jsp%3Farnumber%3D6884630%22%2C%22ISSN%22%3A%22%22%2C%22language%22%3A%22%22%2C%22collections%22%3A%5B%22DZFDBB6V%22%2C%22WUTP7CH6%22%2C%22ZA8QMDGD%22%2C%226JKB3X7P%22%5D%2C%22dateModified%22%3A%222015-09-08T16%3A38%3A02Z%22%7D%7D%2C%7B%22key%22%3A%22GTXPRIVJ%22%2C%22library%22%3A%7B%22id%22%3A1399621%7D%2C%22meta%22%3A%7B%22creatorSummary%22%3A%22Eriksson%20et%20al.%22%2C%22parsedDate%22%3A%222012%22%2C%22numChildren%22%3A2%7D%2C%22bib%22%3A%22%26lt%3Bdiv%20class%3D%26quot%3Bcsl-bib-body%26quot%3B%20style%3D%26quot%3Bline-height%3A%202%3B%20padding-left%3A%201em%3B%20text-indent%3A-1em%3B%26quot%3B%26gt%3B%5Cn%20%20%26lt%3Bdiv%20class%3D%26quot%3Bcsl-entry%26quot%3B%26gt%3BEriksson%2C%20B.%2C%20Balzano%2C%20L.%2C%20%26amp%3B%20Nowak%2C%20R.%20%282012%29.%20High%20rank%20matrix%20completion.%20%26lt%3Bi%26gt%3BProc.%20of%20Intl.%20Conf.%20on%20Artificial%20Intell.%20and%20Stat%26lt%3B%5C%2Fi%26gt%3B.%20%26lt%3Ba%20class%3D%26%23039%3Bzp-ItemURL%26%23039%3B%20href%3D%26%23039%3Bhttp%3A%5C%2F%5C%2Fjmlr.csail.mit.edu%5C%2Fproceedings%5C%2Fpapers%5C%2Fv22%5C%2Feriksson12%5C%2Feriksson12.pdf%26%23039%3B%26gt%3Bhttp%3A%5C%2F%5C%2Fjmlr.csail.mit.edu%5C%2Fproceedings%5C%2Fpapers%5C%2Fv22%5C%2Feriksson12%5C%2Feriksson12.pdf%26lt%3B%5C%2Fa%26gt%3B%20%26lt%3Bsup%20class%3D%26quot%3Bzp-Notes-Reference%26quot%3B%26gt%3B%26lt%3Ba%20href%3D%26quot%3B%23zp-Note-GTXPRIVJ%26quot%3B%26gt%3B1%26lt%3B%5C%2Fa%26gt%3B%26lt%3B%5C%2Fsup%26gt%3B%20%26lt%3B%5C%2Fdiv%26gt%3B%5Cn%26lt%3B%5C%2Fdiv%26gt%3B%22%2C%22data%22%3A%7B%22itemType%22%3A%22conferencePaper%22%2C%22title%22%3A%22High%20rank%20matrix%20completion%22%2C%22creators%22%3A%5B%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Brian%22%2C%22lastName%22%3A%22Eriksson%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Laura%22%2C%22lastName%22%3A%22Balzano%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Robert%22%2C%22lastName%22%3A%22Nowak%22%7D%5D%2C%22abstractNote%22%3A%22%22%2C%22proceedingsTitle%22%3A%22Proc.%20of%20Intl.%20Conf.%20on%20Artificial%20Intell.%20and%20Stat%22%2C%22conferenceName%22%3A%22%22%2C%22date%22%3A%222012%22%2C%22DOI%22%3A%22%22%2C%22ISBN%22%3A%22%22%2C%22citationKey%22%3A%22%22%2C%22url%22%3A%22http%3A%5C%2F%5C%2Fjmlr.csail.mit.edu%5C%2Fproceedings%5C%2Fpapers%5C%2Fv22%5C%2Feriksson12%5C%2Feriksson12.pdf%22%2C%22ISSN%22%3A%22%22%2C%22language%22%3A%22%22%2C%22collections%22%3A%5B%22DZFDBB6V%22%2C%22WUTP7CH6%22%2C%22ZA8QMDGD%22%2C%226JKB3X7P%22%2C%22HJQ26QYG%22%5D%2C%22dateModified%22%3A%222013-05-17T18%3A38%3A09Z%22%7D%2C%22notes%22%3A%22%3Cli%20id%3D%5C%22zp-Note-GTXPRIVJ%5C%22%3E%5Cn%3Cp%3EA%20complete%20report%20of%20our%20High%20Rank%20Matrix%20Completion%20paper%20can%20be%20found%20%3Ca%20href%3D%5C%22http%3A%5C%2F%5C%2Farxiv.org%5C%2Fabs%5C%2F1112.5629%5C%22%3Eat%20the%20arxiv%3C%5C%2Fa%3E.%20A%20youtube%20video%20of%20my%20poster%20presentation%20of%20this%20work%20at%20the%20ITA%20workshop%20%3Ca%20href%3D%5C%22http%3A%5C%2F%5C%2Fwww.youtube.com%5C%2Fwatch%3Fv%3DthnHe43S0z4%5C%22%3Ecan%20be%20found%20here%3C%5C%2Fa%3E.%3C%5C%2Fp%3E%5Cn%3C%5C%2Fli%3E%5Cn%22%7D%2C%7B%22key%22%3A%22ZPS2BSDF%22%2C%22library%22%3A%7B%22id%22%3A1399621%7D%2C%22meta%22%3A%7B%22creatorSummary%22%3A%22Balzano%20et%20al.%22%2C%22parsedDate%22%3A%222012%22%2C%22numChildren%22%3A2%7D%2C%22bib%22%3A%22%26lt%3Bdiv%20class%3D%26quot%3Bcsl-bib-body%26quot%3B%20style%3D%26quot%3Bline-height%3A%202%3B%20padding-left%3A%201em%3B%20text-indent%3A-1em%3B%26quot%3B%26gt%3B%5Cn%20%20%26lt%3Bdiv%20class%3D%26quot%3Bcsl-entry%26quot%3B%26gt%3BBalzano%2C%20L.%2C%20Szlam%2C%20A.%2C%20Recht%2C%20B.%2C%20%26amp%3B%20Nowak%2C%20R.%20%282012%29.%20K-subspaces%20with%20missing%20data.%20%26lt%3Bi%26gt%3BStatistical%20Signal%20Processing%20Workshop%20%28SSP%29%2C%202012%20IEEE%26lt%3B%5C%2Fi%26gt%3B%2C%20612%26%23x2013%3B615.%20%26lt%3Ba%20class%3D%26%23039%3Bzp-ItemURL%26%23039%3B%20href%3D%26%23039%3Bhttp%3A%5C%2F%5C%2Fieeexplore.ieee.org%5C%2Fxpls%5C%2Fabs_all.jsp%3Farnumber%3D6319774%26%23039%3B%26gt%3Bhttp%3A%5C%2F%5C%2Fieeexplore.ieee.org%5C%2Fxpls%5C%2Fabs_all.jsp%3Farnumber%3D6319774%26lt%3B%5C%2Fa%26gt%3B%26lt%3B%5C%2Fdiv%26gt%3B%5Cn%26lt%3B%5C%2Fdiv%26gt%3B%22%2C%22data%22%3A%7B%22itemType%22%3A%22conferencePaper%22%2C%22title%22%3A%22K-subspaces%20with%20missing%20data%22%2C%22creators%22%3A%5B%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Laura%22%2C%22lastName%22%3A%22Balzano%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Arthur%22%2C%22lastName%22%3A%22Szlam%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Benjamin%22%2C%22lastName%22%3A%22Recht%22%7D%2C%7B%22creatorType%22%3A%22author%22%2C%22firstName%22%3A%22Robert%22%2C%22lastName%22%3A%22Nowak%22%7D%5D%2C%22abstractNote%22%3A%22%22%2C%22proceedingsTitle%22%3A%22Statistical%20Signal%20Processing%20Workshop%20%28SSP%29%2C%202012%20IEEE%22%2C%22conferenceName%22%3A%22%22%2C%22date%22%3A%222012%22%2C%22DOI%22%3A%22%22%2C%22ISBN%22%3A%22%22%2C%22citationKey%22%3A%22%22%2C%22url%22%3A%22http%3A%5C%2F%5C%2Fieeexplore.ieee.org%5C%2Fxpls%5C%2Fabs_all.jsp%3Farnumber%3D6319774%22%2C%22ISSN%22%3A%22%22%2C%22language%22%3A%22%22%2C%22collections%22%3A%5B%22DZFDBB6V%22%2C%22WUTP7CH6%22%2C%22ZA8QMDGD%22%2C%226JKB3X7P%22%5D%2C%22dateModified%22%3A%222013-05-17T18%3A39%3A06Z%22%7D%7D%5D%7D
Hong, D., & Balzano, L. (2025). Optimal sample acquisition for optimally weighted PCA from heterogeneous quality sources. IEEE Signal Processing Letters, 1–5. https://doi.org/10.1109/LSP.2025.3550280
Lipor, J., Hong, D., Tan, Y. S., & Balzano, L. (2021). Subspace clustering using ensembles of K-subspaces. Information and Inference: A Journal of the IMA, 10(1), 73–107. https://doi.org/10.1093/imaiai/iaaa031
Lipor, J., & Balzano, L. (2020). Clustering quality metrics for subspace clustering. Pattern Recognition, 107328. https://doi.org/10.1016/j.patcog.2020.107328
Pimentel-Alarcón, D., Ongie, G., Balzano, L., Willett, R., & Nowak, R. (2017). Low algebraic dimension matrix completion. 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 790–797. https://doi.org/10.1109/ALLERTON.2017.8262820
Pimentel-Alarcón, D., Balzano, L., Marcia, R., Nowak, R., & Willett, R. (2017). Mixture regression as subspace clustering. 2017 International Conference on Sampling Theory and Applications (SampTA), 456–459. https://doi.org/10.1109/SAMPTA.2017.8024386
Pimentel-Alarcón, D., Balzano, L., Marcia, R., Nowak, R., & Willett, R. (2016). Group-sparse subspace clustering with missing data. 2016 IEEE Statistical Signal Processing Workshop (SSP), 1–5. https://doi.org/10.1109/SSP.2016.7551734
Pimentel-Alarcón, D., Balzano, L., & Nowak, R. (2016). Necessary and sufficient conditions for sketched subspace clustering. Allerton Conference on Communication, Control, and Computing. https://danielpimentel.github.io/pdfs/sketchedSC.pdf
Lipor, J., & Balzano, L. (2015). Margin-based active subspace clustering. 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 377–380. https://doi.org/10.1109/CAMSAP.2015.7383815
Pimentel, D., Nowak, R., & Balzano, L. (2014). On the sample complexity of subspace clustering with missing data. 2014 IEEE Workshop on Statistical Signal Processing (SSP), 280–283. http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6884630
Eriksson, B., Balzano, L., & Nowak, R. (2012). High rank matrix completion. Proc. of Intl. Conf. on Artificial Intell. and Stat. http://jmlr.csail.mit.edu/proceedings/papers/v22/eriksson12/eriksson12.pdf 1
Balzano, L., Szlam, A., Recht, B., & Nowak, R. (2012). K-subspaces with missing data. Statistical Signal Processing Workshop (SSP), 2012 IEEE, 612–615. http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6319774
