The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering
Open accessAbstract
State-of-the-art subspace clustering methods are based on expressing each data point as a linear combination of other data points while regularizing the matrix of coefficients with ℓ1, ℓ2or nuclear norms. ℓ1regularization is guaranteed to give a subspace-preserving affinity (i.e., there are no connections between points from different subspaces) under broad theoretical conditions, but the clusters may not be connected. ℓ2and nuclear norm regularization often improve connectivity, but give a subspace-preserving affinity only for independent subspaces. Mixed ℓ1, ℓ2and nuclear norm regularizations offer a balance between the subspace-preserving and connectedness properties, but this comes at the cost of increased computational complexity. This paper studies the geometry of the elastic net regularizer (a mixture of the ℓ1and ℓ2norms) and uses it to derive a provably correct and scalable active set method for finding the optimal coefficients. Our geometric analysis also provides a theoretical justification and a geometric interpretation for the balance between the connectedness (due to ℓ2regularization) and subspace-preserving (due to ℓ1regularization) properties for elastic net subspace clustering. Our experiments show that the proposed active set method not only achieves state-of-the-art clustering performance, but also efficiently handles large-scale datasets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Regularization and Variable Selection Via the Elastic Net
Zou, H., & Hastie, T. (2005) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2005.00503.x · Cited by 20,957
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Robust Recovery of Subspace Structures by Low-Rank Representation
Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., & Ma, Y. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.88 · Cited by 3,594
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Elhamifar, E., & Vidal, R. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.57 · Cited by 3,106
Self-citationInvariant Scattering Convolution Networks
Bruna, J., & Mallat, S. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.230 · Cited by 1,633
Gross, R., Matthews, I., Cohn, J., Kanade, T., & Baker, S. (2010) · Image and Vision Computing · doi:10.1016/j.imavis.2009.08.002 · Cited by 1,621
Robust Subspace Segmentation by Low-Rank Representation
Liu, G., Lin, Z., & Yu, Y. H. (2010) · Cited by 1,534
Columbia Object Image Library (COIL100)
Nayar, S. K. (1996) · Medical Entomology and Zoology · Cited by 1,372
Elhamifar, E., & Vidal, R. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206547 · Cited by 1,243
Self-citationVidal, R. (2011) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.939739 · Cited by 1,126
Self-citationGeneralized principal component analysis (GPCA)
Vidal, R., Ma, Y., & Sastry, S. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.244 · Cited by 1,038
Self-citationLinearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation
Lin, Z., Liu, R., & Su, Z. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.0367 · Cited by 992
Robust and Efficient Subspace Segmentation via Least Squares Regression
Lu, C., Min, H., Zhao, Z., Zhu, L., Huang, D.-S., & Yan, S. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-33786-4_26 · Cited by 718
A Multibody Factorization Method for Independently Moving Objects
Costeira, J. P., & Kanade, T. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008000628999 · Cited by 661
Clustering appearances of objects under varying illumination conditions
Ho, J., Yang, M.-H., Lim, J., Lee, K.-C., & Kriegman, D. (2003) · 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. · doi:10.1109/cvpr.2003.1211332 · Cited by 521
Low rank subspace clustering (LRSC)
Vidal, R., & Favaro, P. (2014) · Pattern Recognition Letters · doi:10.1016/j.patrec.2013.08.006 · Cited by 482
Self-citationA geometric analysis of subspace clustering with outliers
Soltanolkotabi, M., & Candés, E. J. (2012) · The Annals of Statistics · doi:10.1214/12-aos1034 · Cited by 411
Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit
You, C., Robinson, D. P., & Vidal, R. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.425 · Cited by 380
Self-citationLarge Scale Spectral Clustering with Landmark-Based Representation
Chen, X., & Cai, D. (2011) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v25i1.7900 · Cited by 378
Generalized Principal Component Analysis
Vidal, R., Ma, Y., & Sastry, S. S. (2016) · Interdisciplinary Applied Mathematics · doi:10.1007/978-0-387-87811-9 · Cited by 357
Self-citationMultiframe Motion Segmentation with Missing Data Using PowerFactorization and GPCA
Vidal, R., Tron, R., & Hartley, R. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0099-z · Cited by 216
Self-citationCorrelation Adaptive Subspace Segmentation by Trace Lasso
Lu, C., Feng, J., Lin, Z., & Yan, S. (2013) · 2013 IEEE International Conference on Computer Vision · doi:10.1109/iccv.2013.170 · Cited by 204
Multiscale Hybrid Linear Models for Lossy Image Representation
Hong, W., Wright, J., Huang, K., & Ma, Y. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.882016 · Cited by 195
Structured Sparse Subspace Clustering: A unified optimization framework
Li, C.-G., & Vidal, R. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298624 · Cited by 186
Self-citationProvable Subspace Clustering: When LRR Meets SSC
Wang, Y.-X., Xu, H., & Leng, C. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2915593 · Cited by 175
Greedy Feature Selection for Subspace ClusteringPreprint
Dyer, E. L., Sankaranarayanan, A. C., & Baraniuk, R. G. (2013) · arXiv (Cornell University) · doi:10.5555/2567709.2567741 · Cited by 156
Hybrid Linear Modeling via Local Best-fit FlatsPreprint
Zhang, T., Szlam, A. D., Wang, Y., & Lerman, G. (2010) · Cited by 146
Hybrid Linear Modeling via Local Best-Fit Flats
Zhang, T., Szlam, A., Wang, Y., & Lerman, G. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-012-0535-6 · Cited by 143
Sparse Prediction with the $k$-Support NormPreprint
Argyriou, A., Foygel, R., & Srebro, N. (2012) · HAL · doi:10.48550/arxiv.1204.5043 · Cited by 124
Graph-Based Learning via Auto-Grouped Sparse Regularization and Kernelized Extension
Fang, Y., Wang, R., Dai, B., & Wu, X. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2312322 · Cited by 46
Noisy Sparse Subspace ClusteringPreprint
Wang, Y.-X., & Xu, H. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.1233 · Cited by 43
Filtrated Spectral Algebraic Subspace Clustering
Tsakiris, M. C., & Vidal, R. (2015) · IEEE International Conference on Computer Vision Workshops · doi:10.1109/iccvw.2015.116 · Cited by 7
Self-citation
Cited by
Subspace Clustering by Block Diagonal Representation
Lu, C., Feng, J., Lin, Z., Mei, T., & Yan, S. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2794348 · Cited by 472
On the Applications of Robust PCA in Image and Video Processing
Bouwmans, T., Javed, S., Zhang, H., Lin, Z., & Otazo, R. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2853589 · Cited by 255
Metadata
- Authors
- You, C., Li, C.-G., Robinson, D. P., & Vidal, R.
- Venue
- 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
- Publisher
- IEEE
- Published
- 2016-06
- Pages
- 3928-3937
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2962911132
- Cited by
- 263
- References
- 36
- FWCI
- 14.70
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.