Creditable subspace labeling method
一种可信子空间标志方法*

This paper first gave the definition of creditable subspace based on D-S evidence, and then proposed a greedy algorithm CSL(creditable subspace labeling)which could search all the creditable subspaces.The creditable subspaces of the original data space could be found by iteratively executing the algorithm CSL.Once the creditable subspaces Cs were got, the true clustering results could be found using a traditional clustering algorithm on each creditable subspace. Experiments show that CSL can detect the actual creditable subspace with the original attribute. In this way,proposed a novel approach of using traditional clustering algorithms to deal with high dimensional data set clustering problems.