Study of High-Dimensional Data Analysis based on Clustering Algorithm

With the rapid development of big data, the scale, dimensions, diversity and sparsity of high-dimensional data restrict the effectiveness of traditional clustering algorithms. This paper mainly focuses on high-dimensional data clustering. Starting from the traditional K-means clustering algorithm and subspace clustering algorithm based on self-representation model, an improved algorithm is designed and implemented based on the existing clustering algorithm in this paper. The improved algorithm has better clustering quality by combining the "distance optimization method" and the "density method" to determine the initial clustering center. The feasibility and effectiveness of improved algorithm are verified through simulation experiments.