| Exploration of tensor decomposition applied to commercial building baseline estimation | 0 | 0.34 | 2019 |
| Probabilistic PCA for Heteroscedastic Data | 0 | 0.34 | 2019 |
| Mode Clustering for Markov Jump Systems | 1 | 0.45 | 2019 |
| Asymptotic performance of PCA for high-dimensional heteroscedastic data. | 2 | 0.68 | 2018 |
| Learning Dictionary-Based Unions of Subspaces for Image Denoising. | 0 | 0.34 | 2018 |
| Improving K-Subspaces via Coherence Pursuit. | 3 | 0.39 | 2018 |
| Streaming PCA and Subspace Tracking: The Missing Data Case | 3 | 0.40 | 2018 |
| A Robust Algorithm for Online Switched System Identification. | 0 | 0.34 | 2018 |
| Distance-Penalized Active Learning Using Quantile Search. | 1 | 0.37 | 2017 |
| Online dynamic MRI reconstruction via robust subspace tracking. | 0 | 0.34 | 2017 |
| Low algebraic dimension matrix completion. | 1 | 0.36 | 2017 |
| Subspace Clustering using Ensembles of $K$-Subspaces. | 1 | 0.34 | 2017 |
| Deep Unsupervised Clustering Using Mixture of Autoencoders. | 3 | 0.40 | 2017 |
| What To Expect When You Are Expecting On The Grassmannian | 0 | 0.34 | 2017 |
| Convergence of a Grassmannian Gradient Descent Algorithm for Subspace Estimation From Undersampled Data. | 3 | 0.39 | 2016 |
| Online sparse and orthogonal subspace estimation from partial information. | 0 | 0.34 | 2016 |
| On Learning High Dimensional Structured Single Index Models. | 2 | 0.39 | 2016 |
| Towards a theoretical analysis of PCA for heteroscedastic data | 0 | 0.34 | 2016 |
| Necessary and sufficient conditions for sketched subspace clustering. | 0 | 0.34 | 2016 |
| Inferring the behavior of distributed energy resources with online learning. | 1 | 0.36 | 2015 |
| Global Convergence of a Grassmannian Gradient Descent Algorithm for Subspace Estimation | 8 | 0.59 | 2015 |
| Margin-based active subspace clustering | 2 | 0.36 | 2015 |
| Quantile Search: A Distance-Penalized Active Learning Algorithm for Spatial Sampling | 1 | 0.36 | 2015 |
| On the sample complexity of subspace clustering with missing data | 11 | 0.70 | 2014 |
| High-Rank Matrix Completion. | 2 | 0.40 | 2012 |
| On the success of network inference using a markov routing model | 0 | 0.34 | 2011 |
| High-Rank Matrix Completion and Subspace Clustering with Missing Data | 24 | 1.18 | 2011 |
| High-dimensional Matched Subspace Detection when data are missing | 37 | 1.95 | 2010 |
| Online Identification and Tracking of Subspaces from Highly Incomplete Information | 121 | 4.21 | 2010 |
| Sensor network data fault types | 121 | 5.54 | 2009 |
| Blind calibration of sensor networks | 62 | 4.31 | 2007 |
