Enhanced CABOSFV clustering algorithm based on adaptive threshold

In the light of the sensitivity of the order of data input by CABOSFV clustering algorithm, to enhance performance of CABOSFV, this paper puts forward a novel algorithm to gain an adaptive its threshold on the line(APCABOSFV). In the end experiments on artificial l data sets show demonstrate that the accuracy of the proposed APCABOSFV algorithm outperforms existing CABOSFV clustering algorithm for clustering high-dimensional sparse data.

[1]  Michel Verleysen,et al.  Learning high-dimensional data , 2001 .

[2]  Huan Liu,et al.  Subspace clustering for high dimensional data: a review , 2004, SKDD.

[3]  Nikos Paragios,et al.  Motion-based background subtraction using adaptive kernel density estimation , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[4]  Petra Perner,et al.  Data Mining - Concepts and Techniques , 2002, Künstliche Intell..

[5]  Jianhong Wu,et al.  Projective ART for clustering data sets in high dimensional spaces , 2002, Neural Networks.

[6]  SenWu,et al.  CABOSFV algorithm for high dimensional sparse data clustering , 2004 .

[7]  Pavel Berkhin,et al.  A Survey of Clustering Data Mining Techniques , 2006, Grouping Multidimensional Data.

[8]  Xindong Wu,et al.  10 Challenging Problems in Data Mining Research , 2006, Int. J. Inf. Technol. Decis. Mak..

[9]  Nikos Paragios,et al.  Motion-based background subtraction using adaptive kernel density estimation , 2004, CVPR 2004.

[10]  Sergey Ablameyko,et al.  Limitations and Future Trends in Neural Computation , 2003 .