作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (22): 13-14. doi: 10.3969/j.issn.1000-3428.2010.22.004

• 博士论文 • 上一篇    下一篇

基于排序思想的高维稀疏数据聚类

祝 琴1,2,高学东1,武 森1,陈 敏1,陈 华2   

  1. (1. 北京科技大学经济管理学院,北京 100083;2. 南昌大学管理科学与工程系,南昌 330031)
  • 出版日期:2010-11-20 发布日期:2010-11-18
  • 作者简介:祝 琴(1978-),女,讲师、博士研究生,主研方向:数据挖掘,管理优化;高学东,教授、博士生导师;武 森,副教授、博士;陈 敏,博士研究生; 陈 华,副教授、博士
  • 基金资助:

    国家自然科学基金资助项目(60963008)

High Dimensional Sparse Data Clustering Based on Sorting Idea

ZHU Qin1,2, GAO Xue-dong1, WU Sen1, CHEN Min1, CHEN Hua2   

  1. (1. School of Economics and Management, University of Science and Technology Beijing, Beijing 100083, China; 2. Department of Management Science and Engineering, Nanchang University, Nanchang 330031, China)
  • Online:2010-11-20 Published:2010-11-18

摘要:

针对CABOSFV聚类算法对数据输入顺序的敏感性问题,提出融合排序思想的高属性维稀疏数据聚类算法,通过计算首次聚类中两两高属性维稀疏数据非零属性取值情况确定所需要计算差异度的集合组合,减小了算法复杂度。应用结果表明,该方法能提高CABOSFV聚类的质量。

关键词: 高维稀疏数据, CABOSFV聚类, 排序

Abstract:

In the light of the sensitivity of the order of data input by CABOSFV clustering algorithm, this paper puts forward a high attribute dimensional sparse clustering algorithm of the integration of sorting. The method of how to determine the two sets calculates the difference between two high dimensional sparse data sets in the first clustering, the algorithm complexity is reduced. The method improves the quality and efficiency of clustering. Simulation results of one groups of sample are given to illustrate that it can improve the quality of CABOSFV clustering.

Key words: high dimensional sparse data, CABOSFV clustering, sorting

中图分类号: