Compressive PCA for Low-Rank Matrices on Graphs
暂无分享,去创建一个
Pierre Vandergheynst | Nathanael Perraudin | Gilles Puy | Nauman Shahid | P. Vandergheynst | Nathanael Perraudin | N. Shahid | Gilles Puy
[1] Nathanael Perraudin,et al. Fast Robust PCA on Graphs , 2015, IEEE Journal of Selected Topics in Signal Processing.
[2] Pierre Vandergheynst,et al. Compressive Spectral Clustering , 2016, ICML.
[3] P. Vandergheynst,et al. Accelerated filtering on graphs using Lanczos method , 2015, 1509.04537.
[4] Pradeep Ravikumar,et al. Collaborative Filtering with Graph Information: Consistency and Scalable Methods , 2015, NIPS.
[5] Richard G. Baraniuk,et al. Signal Processing With Compressive Measurements , 2010, IEEE Journal of Selected Topics in Signal Processing.
[6] Florian Dörfler,et al. Kron Reduction of Graphs With Applications to Electrical Networks , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.
[7] Thomas S. Huang,et al. Graph Regularized Nonnegative Matrix Factorization for Data Representation. , 2011, IEEE transactions on pattern analysis and machine intelligence.
[8] Pierre Vandergheynst,et al. UNLocBoX A matlab convex optimization toolbox using proximal splitting methods , 2014, ArXiv.
[9] Jarvis D. Haupt,et al. Identifying Outliers in Large Matrices via Randomized Adaptive Compressive Sampling , 2014, IEEE Transactions on Signal Processing.
[10] Fei Wang,et al. Graph dual regularization non-negative matrix factorization for co-clustering , 2012, Pattern Recognit..
[11] Daniel P. Robinson,et al. Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit , 2015, 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
[12] Pierre Vandergheynst,et al. GSPBOX: A toolbox for signal processing on graphs , 2014, ArXiv.
[13] H. Sebastian Seung,et al. Learning the parts of objects by non-negative matrix factorization , 1999, Nature.
[14] Charles Elkan,et al. Using the Triangle Inequality to Accelerate k-Means , 2003, ICML.
[15] Yasuyuki Matsushita,et al. Fast randomized Singular Value Thresholding for Nuclear Norm Minimization , 2015, 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR).
[16] Mikhail Belkin,et al. Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.
[17] Jane You,et al. Low-rank matrix factorization with multiple Hypergraph regularizer , 2015, Pattern Recognit..
[18] O. Axelsson,et al. On the rate of convergence of the preconditioned conjugate gradient method , 1986 .
[19] Wooseok Ha,et al. Robust PCA with compressed data , 2015, NIPS.
[20] George Atia,et al. High Dimensional Low Rank Plus Sparse Matrix Decomposition , 2015, IEEE Transactions on Signal Processing.
[21] Pierre Vandergheynst,et al. Random sampling of bandlimited signals on graphs , 2015, NIPS 2015.
[22] Nathan Halko,et al. Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..
[23] Volkan Cevher,et al. A variational approach to stable principal component pursuit , 2014, UAI.
[24] Hanan Samet,et al. A fast all nearest neighbor algorithm for applications involving large point-clouds , 2007, Comput. Graph..
[25] J. Tropp. On the conditioning of random subdictionaries , 2008 .
[26] Xavier Bresson,et al. Robust Principal Component Analysis on Graphs , 2015, 2015 IEEE International Conference on Computer Vision (ICCV).
[27] Liang-Tien Chia,et al. Laplacian Sparse Coding, Hypergraph Laplacian Sparse Coding, and Applications , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[28] Marc Teboulle,et al. A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..
[29] Yinglin Wang,et al. Low rank approximation with sparse integration of multiple manifolds for data representation , 2014, Applied Intelligence.
[30] Zhenyue Zhang,et al. Low-Rank Matrix Approximation with Manifold Regularization , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[31] Yong Yu,et al. Robust Recovery of Subspace Structures by Low-Rank Representation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[32] D. T. Lee,et al. Capacitated Domination: Problem Complexity and Approximation Algorithms , 2015, Algorithmica.
[33] Pierre Vandergheynst,et al. Stationary Signal Processing on Graphs , 2016, IEEE Transactions on Signal Processing.
[34] Emmanuel J. Candès,et al. Randomized Algorithms for Low-Rank Matrix Factorizations: Sharp Performance Bounds , 2013, Algorithmica.
[35] Pascal Frossard,et al. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.
[36] Matthias W. Seeger,et al. Using the Nyström Method to Speed Up Kernel Machines , 2000, NIPS.
[37] Antonio Ortega,et al. Generalized Laplacian precision matrix estimation for graph signal processing , 2016, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).
[38] Santiago Segarra,et al. Network topology identification from spectral templates , 2016, 2016 IEEE Statistical Signal Processing Workshop (SSP).
[39] Jin Tang,et al. Graph-Laplacian PCA: Closed-Form Solution and Robustness , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.
[40] Vassilis Kalofolias,et al. How to Learn a Graph from Smooth Signals , 2016, AISTATS.
[41] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[42] Ameet Talwalkar,et al. Matrix Coherence and the Nystrom Method , 2010, UAI.
[43] Christos Boutsidis,et al. An improved approximation algorithm for the column subset selection problem , 2008, SODA.
[44] S T Roweis,et al. Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.
[45] Yulong Wang,et al. Graph-Regularized Low-Rank Representation for Destriping of Hyperspectral Images , 2013, IEEE Transactions on Geoscience and Remote Sensing.
[46] David G. Lowe,et al. Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration , 2009, VISAPP.
[47] George Atia,et al. Randomized robust subspace recovery for big data , 2015, 2015 IEEE 25th International Workshop on Machine Learning for Signal Processing (MLSP).
[48] Xiaojun Wu,et al. Graph Regularized Nonnegative Matrix Factorization for Data Representation , 2017, IEEE Transactions on Pattern Analysis and Machine Intelligence.