首页 | 本学科首页   官方微博 | 高级检索  
     

基于排序思想的高维稀疏数据聚类
引用本文:祝琴,高学东,武森,陈敏,陈华.基于排序思想的高维稀疏数据聚类[J].计算机工程,2010,36(22):13-14.
作者姓名:祝琴  高学东  武森  陈敏  陈华
作者单位:(1. 北京科技大学经济管理学院,北京 100083;2. 南昌大学管理科学与工程系,南昌 330031)
基金项目:国家自然科学基金资助项目
摘    要:针对CABOSFV聚类算法对数据输入顺序的敏感性问题,提出融合排序思想的高属性维稀疏数据聚类算法,通过计算首次聚类中两两高属性维稀疏数据非零属性取值情况确定所需要计算差异度的集合组合,减小了算法复杂度。应用结果表明,该方法能提高CABOSFV聚类的质量。

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

High Dimensional Sparse Data Clustering Based on Sorting Idea
ZHU Qin,GAO Xue-dong,WU Sen,CHEN Min,CHEN Hua.High Dimensional Sparse Data Clustering Based on Sorting Idea[J].Computer Engineering,2010,36(22):13-14.
Authors:ZHU Qin  GAO Xue-dong  WU Sen  CHEN Min  CHEN Hua
Affiliation:(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)
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.
Keywords:high dimensional sparse data  CABOSFV clustering  sorting
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号