Preserving Local and Global Information: An Effective Metric-based Subspace Clustering
Open Access
- 26 October 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 3619-3627
Abstract
No abstract availableFunding Information
- the Key Program of National Science Foundation of China under Grant (61836006)
This publication has 30 references indexed in Scilit:
- Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit2016
- Feature Selection Embedded Subspace ClusteringIEEE Signal Processing Letters, 2016
- Constructing the L2-Graph for Robust Subspace Learning and Subspace ClusteringIEEE Transactions on Cybernetics, 2016
- FaceNet: A unified embedding for face recognition and clustering2015
- Sparse Subspace Clustering: Algorithm, Theory, and ApplicationsIEEE Transactions on Pattern Analysis and Machine Intelligence, 2013
- Robust and Efficient Subspace Segmentation via Least Squares Regression2012
- Handwritten Chinese text line segmentation by clustering with distance metric learningPattern Recognition, 2009
- Pearson Correlation Coefficient2009
- Trajectory clustering2007
- Convex Optimization2004