Subspace clustering of high-dimensional data is a hot issue in the field of unsupervised learning.The difficulty of sub-space clustering lies in finding the appropriate subspaces and corresponding clusters.At present,the most existing subspace clus-tering algorithms have the drawbacks of high computational complexity and difficulty in parameter selection because the number of subspaces combinations is very large and the algorithmic execution time is very long for high-dimensional data.Also,the diffe-rent datasets and application scenarios require different parameter inputs.Thus,this paper proposes a new subspace clustering al-gorithm named sub-I-nice to recognize all clusters in subspaces.First,the sub-I-nice algorithm randomly divides the original di-mensions into groups to build subspaces.Second,I-niceMO algorithm is used to recognize clusters in each subspace.Finally,the newly-designed ball model is designed to construct subspace clustering ensemble.The persuasive experiments are conducted to validate the clustering performances of sub-I-nice algorithm on synthetic datasets with noise.Experimental results show that the sub-I-nice algorithm has better accuracy and robustness compared to the other three representative clustering algorithms,thereby confirming the rationality and effectiveness of the proposed algorithm.
Subspace clusteringI-nice clusteringHigh-dimensional dataUnsupervised learningBall model