A deterministic analysis of noisy sparse subspace clustering for dimensionality-reduced data

32nd International Conference on Machine Learning, ICML 2015

Volumn 2, Issue , 2015, Pages 1422-1431

  Wang, Yining ^a   Wang, Yu Xiang ^a   Singh, Aarti ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; LEARNING SYSTEMS; OPTIMIZATION; STOCHASTIC SYSTEMS;

DATA DIMENSIONS; DETERMINISTIC ANALYSIS; OPTIMIZATION-BASED ALGORITHM; RANDOM PROJECTIONS; REDUCED DATA; STOCHASTIC NOISE; SUB-SPACE CLUSTERING; THEORETICAL FRAMEWORK;

CLUSTERING ALGORITHMS;

EID: 84969779036     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. Ailon, Nir and Chazelle, Bernard. The fast johnson-lindenstrauss transform and approximate nearest neighbors. SIAM Journal of Computing, 39(1):302-322, 2009.
2. Arpit, Devansh, Nwogu, Ifeoma, and Govindaraju, Venu. Dimensionality reduction with subspace structure preservation. In NIPS, 2014.
3. Avron, Haim, Nguyen, Huy, and Woodruff, David. Sub-space embeddings for the polynomial kernel. In NIPS, 2014.
4. Balzano, Laura, Recht, Benjamin, and Nowak, Robert. High-dimensional matched subspace detection when data are missing. In ISIT, 2010.
5. Basri, Ronen and Jacobs, David. Lambertian reflectance and linear subspaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(2):218-233, 2003.
6. Charikar, Moses, Chen, Kevin, and Farach-Colton, Martin. Finding frequent items in data streams. Theoretical Computer Science, 312(1):3-15, 2004.
7. Chen, Yudong, Bhojanapalli, Srinadh, Sanghavi, Sujay, and Ward, Rachel. Completing any low-rank matrix, provably. arXiv: 1306.2979, 2013.
8. Clarkson, Kenneth and Woodruff, David. Low rank approximation and regression in input sparsity time. In STOC, 2013.
9. Costeira, Joao and Kanade, Takeo. A multibody factorization method for independently moving objects. International Journal of Computer Vision, 29(3): 159-179, 1998.
10. Dwork, Cynthia. Differential privacy. In Automata, languages and programming, pp. 1-12. Springer, 2006.
11. Dwork, Cynthia, McSherry, Frank, Nissim, Kobbi, and Smith, Adam. Calibrating noise to sensitivity in private data analysis. In Theory of cryptography, pp. 265-284. Springer, 2006.
12. Elhamifar, Ehsan and Vidal, René. Sparse subspace clustering. In Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, pp. 2790-2797. IEEE, 2009.
13. Elhamifar, Ehsen and Vidal, Rene. Sparse subspace clustering: Algorithm, theory and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35 (11):2765-2781, 2013.
14. Eriksson, Brian, Balzano, Laura, and Nowak, Robert. High rank matrix completion. In AISTATS, 2012.
15. Heckel, Reinhard and Bolcskei, Helmut. Robust subspace clustering via thresholding. arXiv:1307.4891, 2013.
16. Heckel, Reinhard, Tschannen, Michael, and Bolcskei, Helmut. Subspace clustering of dimensionality-reduced data. In IS1T, 2014.
17. Jalali, Ali, Chen, Yudong, Sanghavi, Sujay, and Xu, Huan. Clustering partially observed graphs via convex optimization. In ICML, 2011.
18. Kenthapadi, Krishnaram, Korolova, Aleksandra, Mironov, Ilya, and Mishra, Nina. Privacy via the johnson-lindenstrauss transform. Journal of Privacy and Confidentiality, 5(1):39-71, 2013.
19. Krishnamurthy, Akshay and Singh, Aarti. On the power of adaptivity in matrix completion and approximation. Arxiv: 1407.3619, 2014.
20. Lee, Kuang-Chih, Ho, Jeffrey, and Kriegman, David. Acquiring linear subspaces for face recognition under variable lighting. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(5):684-698, 2005.
21. Liu, Guangcan. Solving the low-rank representation (LRR) problems. Available online, August 2013. URL https://sites.google.com/site/guangcanliu/.
22. Liu, Guangcan, Lin, Zhouchen, Shuicheng, Yan, Sun, Ju, Ma, Yi, and Yu, Yong. Robust recovery of subspace structures by low-rank representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35 (1): 171-184, 2013.
23. Recht, Benjamin. A simpler approach to matrix completion. The Journal of Machine Learning Research, 12: 3413-3430, 2011.
24. Shi, Jianbo and Malik, Jitendra. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
25. Soltanolkotabi, Mahdi, Candes, Emmanuel J, et al. A geometric analysis of subspace clustering with outliers. The Annals of Statistics, 40(4):2195-2238, 2012.
26. Soltanolkotabi, Mahdi, Elhamifar, Ehsan, Candes, Emmanuel J, et al. Robust subspace clustering. The Annals of Statistics, 42(2):669-699, 2014.
27. Tibshirani, Ryan and Taylor, Jonathan. The solution path of the generalized lasso. Annals of Statistics, 39(3): 1335-1371, 2011.
28. Tron, Roberto and Vidal, Rene. A benchmark for the comparison of 3-D motion segmentation algorithms. In CVPR, 2007.
29. Wang, Yining, Wang, Yu-Xiang, and Singh, Aarti. Clustering consistent sparse subspace clustering. arXiv:1504.01046, 2015.
30. Wang, Yu-Xiang and Xu, Huan. Noisy sparse subspace clustering. arXiv:1309.1233, 2013.
31. Wang, Yu-Xiang, Xu, Huan, and Leng, Chenlei. Provable subspace clustering: When LRR meets SSC. In NIPS, 2013.
32. Zhang, Amy, Fawaz, Nadia, Ioannidis, Stratis, and Montanari, Andrea. Guess who rated this movie: Identifying users through subspace clustering. In UAI, 2012.
33. Zhou, Shuheng, Lafferty, John, and Wasserman, Larry. Compressed and privacy-sensitive sparse regression. IEEE Transactions on Information Theory, 55(2):846-866, 2009.