首页 >> 收录期刊 >> 计算机科学 >> 正文
杂志中文名:计算机科学
杂志英文名:Computer Science
主管单位:国家科学技术部
主办单位:国家科技部西南信息中心
地址:重庆市渝北区北部新区洪湖西路18号
邮编:401121
电话:023-63500828;
Email:jsjkx12@163.com
ISSN:1002-137X
主编:朱完元












基于自适应权重的粗糙K均值聚类算法
引用本文:周杨,苗夺谦,岳晓冬.基于自适应权重的粗糙K均值聚类算法[J].计算机科学,2011,38(6):237-241.
作者姓名:周杨  苗夺谦  岳晓冬
作者单位:1. 同济大学电子与信息工程学院,上海,201804
2. 同济大学嵌入式系统与服务计算教育部重点实验室,上海,201804
3. 国家高性能计算机工程中心同济分中心,上海,201804
基金项目:本文受国家自然科学基金(60475019,60970061)资助。
摘    要:原有Rough K-means算法中类的上、下近似采用固定经验权重,其科学性值得商榷,针对这一问题,设计了一种基于自适应权重的粗糙K均值聚类算法。基于自适应权重的粗糙聚类算法在每一次迭代过程中,根据当前的数据划分状态,动态计算每个样本对于类的权重,降低了原有算法对初始权重的依赖。此外,该算法采用近似集合中的高斯距离比例来表现样本权重,从而可以在多种数据分布上得到更精确的聚类结果。实验结果表明,基于自适应权重的粗糙K均值算法是一种较优的聚类算法。

关 键 词:聚类,粗糙集,粗糙K均值,自适应权重

Rough It-means Clustering Based on Self-adaptive Weights
ZHOU Yang,MIAO Duo-qian,YUE Xiao-dong.Rough It-means Clustering Based on Self-adaptive Weights[J].Computer Science,2011,38(6):237-241.
Authors:ZHOU Yang  MIAO Duo-qian  YUE Xiao-dong
Abstract:The fixed weights are adopted in the traditional rough K-means algorithm to represent the different approximations of the clusters, but it is always difficult to predefine the optimal weights with little priori knowledge before clustering. Therefore,an improved rough K-means algorithm based on self-adaptive weights was proposed in this paper.The new method computes the weights for every data according to the current clustering state and no more does rely on the initial weights. Furthermore, the self-adaptive weights arc obtained from the Gaussian distance ration in cluster approximation, which can lead to the more accurate clustering results. The experiments indicate that the rough K-means based on self-adaptive weights is an effective rough clustering algorithm.
Keywords:Clustering  Rough sets  Rough K-means  Self-adaptive weight
本文献已被 万方数据 等数据库收录!
    浏览原始摘要     下载PDF全文