| CABOSFV algorithm for high dimensional sparse data clustering |
| |
| 引用本文： | SenWu XuedongGao. CABOSFV algorithm for high dimensional sparse data clustering[J]. 北京科技大学学报(英文版), 2004, 11(3): 283-288 |
| |
| 作者姓名： | SenWu XuedongGao |
| |
| 作者单位： | ManagementSchool,UniversityofScienceandTechnologyBeijing,Beijing100083,China |
| |
| 摘 要： | 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.
|
| 关 键 词： | 数据采矿 高维分散数据集 聚类算法 分散特征矢量 CABOSFV |
CABOSFV algorithm for high dimensional sparse data clustering |
| |
| Sen Wu,Xuedong Gao. CABOSFV algorithm for high dimensional sparse data clustering[J]. Journal of University of Science and Technology Beijing, 2004, 11(3): 283-288 |
| |
| Authors: | Sen Wu Xuedong Gao |
| |
| Abstract: | 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. |
| |
| Keywords: | clustering data mining sparse high dimensionality |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
