A Creditable Subspace Labeling Method Based on D-S Evidence Theory
Due to inherent sparse, noise and nearly zero difference characteristics of high dimensional data sets, traditional clustering methods fails to detect meaningful clusters in them. Subspace clustering attempts to find the true distribution inherent to the subsets with original attributes. However, which subspace contains the true clustering result is usually uncertain. From this point of view, subspace clustering can be regarded as an uncertain discursion problem. In this paper, we firstly develop the criterion to evaluate creditable subspaces which contain the meaningful clustering results, and then propose a creditable subspace labeling method (CSL) based on D-S evidence theory. The creditable subspaces of the original data space can be found by iteratively executing the algorithm CSL. Once the creditable subspaces are got, the true clustering results can 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, a novel approach of clustering problems using traditional clustering algorithms to deal with high dimension data sets is proposed.
KeywordsCluster Algorithm Subspace Cluster Evidence Theory Spatial Data Mining Original Data Space
Unable to display preview. Download preview PDF.
- 1.Berkhin, P.: Survey of clustering data mining techniques. Technical report, Accrue Software, San Jose, California (2002)Google Scholar
- 3.Ng, R.T., Han, J.: Efficient and Effective Clustering Method for Spatial Data Mining. In: Proceeding of the 20th VLDB Conference, pp. 144–155 (1994)Google Scholar
- 5.Zhang, T., Ramakrishna, R., Livny, M.: BIRCH: A New Data Clustering Algorithm and its Applications. Journal of Data Mining and Knowledge Discovery, 141–182 (1997)Google Scholar
- 6.Guha, S., Rastogi, R., Shim, K.: CURE: An efficient clustering algorithm for large database. In: Proceedings of the 1998 ACM SIGMOD international conference on Management of data, pp. 73–84 (1998)Google Scholar
- 7.Ester, M., Kriegel, H.P., Sander, J., et al.: A density-based algorithm for discovering clusters in large spatial database. In: Proc.1996 Int. Conf.Knowledge Discovery and Data Mining (KDD 1996), Portland, OR, August 1996, pp. 226–231 (1996)Google Scholar
- 8.Agrawal, R., Gehrke, J., Gunopulos, D., et al.: Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. In: Proc.1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD 1998), Seattle, WA, June 1998, pp. 94–105 (1998)Google Scholar
- 10.Goil, S., Nagesh, H., Choudhary, A.: MAFIA: Efficient and scalable subspace clustering for very large data sets. Technical Report CPDC-TR-9906-010, Northwestern University, 2145 Sheridan Road, Evanston IL 60208 (June 1999)Google Scholar
- 11.Kailing, K., Kriegel, H., Kroger, P.: Density-connected Subspace Clustering for High-dimensional Data. In: Proc. 4th SIAM Int. Conf. on Data Mining, Lake Buena Vista, FL, pp. 246–257 (2004)Google Scholar