ℓ 1-graph [19, 4], a sparse graph built by reconstructing each datum with all the other data using sparse representation , has been demonstrated to be effective in clustering high dimensional data and recovering independent subspaces from which the data are drawn. It is well known that ℓ 1-norm used in ℓ 1-graph is a convex relaxation of ℓ 0-norm for enforcing the sparsity. In order to handle g...
