Clustering for hyperspectral images (HSIs) is a very challenging task because HSIs usually have large spectral variability, high dimensionality, and complex structures. The main issue of this study is to develop an improved sparse subspace clustering (SSC) method for HSIs. As an extension of spectral clustering, SSC algorithm has achieved great success; however, the direct self-representation dictionary which is created by raw samples has poor representation power and also the widely used dictionary learning (DL) such as K-Singular Value Decomposition (K-SVD) faces with the problems of high computational complexity. In this study, the authors propose a novel HSI clustering method based on sparse DL and anchored regression. The proposed method follows three stages: (i) sparse DL; (ii) anchored subspace construction and regression; and (iii) representation-based spectral clustering. Specifically, we adopt a fast sparse DL method under a double sparsity constrained optimising model to capture the intrinsic HSIs. To establish a compact subspace for collaborative representation, we present an anchored subspace construction method by using atoms clustering and grouping methods. Owing to the anchored subspace, we can fast compute the representation coefficients with a predefined projection matrix. Experimental results demonstrate that the proposed method achieves the best performance for the HSIs clustering.