Self-paced Learning for K-means Clustering Algorithm

•Propose a novel clustering algorithm by adding the self-paced regularization factor.•Improve the problem of non-convex optimization is easy to fall into local optimal solution.•A linear self-paced regularization factor is used to distinguish between noise and normal samples.