Volume 11 Issue 3
Jun.  2004
Turn off MathJax
Article Contents
Sen Wu, and Xuedong Gao, CABOSFV algorithm for high dimensional sparse data clustering, J. Univ. Sci. Technol. Beijing , 11(2004), No. 3, pp.283-288.
Cite this article as: Sen Wu, and Xuedong Gao, CABOSFV algorithm for high dimensional sparse data clustering, J. Univ. Sci. Technol. Beijing , 11(2004), No. 3, pp.283-288.
Automation

CABOSFV algorithm for high dimensional sparse data clustering

Author Affilications
  • An algorithm, Clustering Algorithm Based On Sparse Feature Vector (CABOSFV), was proposed for the high dimensional clustering of binary sparse data. This algorithm compresses the data effectively by using a tool ‘Sparse Feature Vector’, thus reduces the data scale enormously, and can get the clustering result with only one data scan. Both theoretical analysis and empirical tests showed that CABOSFV is of low computational complexity. The algorithm finds clusters in high dimensional large datasets efficiently and handles noise effectively.

Catalog

    Share Article

    Article Metrics

    Article views (422) PDF downloads (22) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return