采用不确定性度量的粗糙模糊C均值聚类参数获取方法

王学恩 1; 韩德强 1; 2; 韩崇昭 1; 2

doi:10.7652/xjtuxb201306010

您当前的位置：

首页 >

文章列表页 >

采用不确定性度量的粗糙模糊C均值聚类参数获取方法

更新时间：2025-05-01

- 采用不确定性度量的粗糙模糊C均值聚类参数获取方法
- Selection Method for Parameters of Rough Fuzzy C-Means Clustering Based on Uncertainty Measurement
- 西安交通大学学报 2013年47卷第6期页码：55-60
- 作者机构：
  
  1. 西安交通大学智能网络与网络安全教育部重点实验室,西安,710049
  2. 西安交通大学电子与信息工程学院,西安,710049
- 作者简介：
- 基金信息：
  
  : 2012-08-06。作者简介: 王学恩(1982—),男,博士生;韩德强(通信作者),男,副教授。基金项目: 国家自然科学基金群体创新基金资助项目(60921003);国家自然科学基金资助项目(61074176,61104214)
- DOI：10.7652/xjtuxb201306010
  中图分类号： TP18
- 网络首发：2013-06-10，
  
  纸质出版：2013
- 稿件说明：
移动端阅览
王学恩 1, 韩德强 1, 2, 等. 采用不确定性度量的粗糙模糊C均值聚类参数获取方法[J]. 西安交通大学学报, 2013,47(6):55-60.

Selection Method for Parameters of Rough Fuzzy C-Means Clustering Based on Uncertainty Measurement[J]. 2013, 47(6): 55-60.
王学恩 1, 韩德强 1, 2, 等. 采用不确定性度量的粗糙模糊C均值聚类参数获取方法[J]. 西安交通大学学报, 2013,47(6):55-60. DOI： 10.7652/xjtuxb201306010.

Selection Method for Parameters of Rough Fuzzy C-Means Clustering Based on Uncertainty Measurement[J]. 2013, 47(6): 55-60. DOI： 10.7652/xjtuxb201306010.

摘要

针对粗糙模糊C均值聚类的阈值、权重选取问题

提出了一种基于不确定性度量的参数自适应获取方法。该方法将阈值选取归结为一个最优划分寻找问题

给出一种基于方差的划分优劣评价方法; 利用信息熵来度量样本归属的模糊性

基于该模糊性度量和类簇的粗糙度

提出了一种权重参数自适应计算方法。将所提方法应用于粗糙模糊C均值聚类

并将分别基于所提方法与典型参数选取方法的粗糙模糊C均值聚类算法在人工数据集和真实数据集上进行实验比较。结果表明

基于所提参数确定方法的粗糙模糊C均值聚类能获得更好的聚类有效性和准确性。

Abstract

A selection method for parameters of the rough fuzzy C-means clustering based on uncertainty measurement is proposed. The selection of parameter threshold is converted into an optimal partition problem

and partitions are evaluated based on variances. The information entropy is employed to measure the fuzziness of the sample membership to clusters

then an adaptive method to calculate weights is presented based on the roughness of clusters and the fuzziness of samples. The adaptive parameter selection method is employed in rough fuzzy C-meaning algorithm. Experiments and comparisons with some existing typical parameters selection methods for rough fuzzy C-means clustering algorithm are performed on synthetic and real-world data sets

and the results show that the proposed algorithm achieves higher accuracy

and is effective.

关键词

Keywords

references

XU R, WUNSCH D. Survey of clustering algorithms [J]. IEEE Transactions on Neural Networks, 2005, 16(3): 645-678.

LINGRAS P, WEST C. Interval set clustering of web users with rough k-means [J]. Journal of Intelligent Information Systems, 2004, 23(1): 5-16.

何明, 冯博琴, 马兆丰, 等. 基于熵和信息粒度的粗糙集聚类算法 [J]. 西安交通大学学报, 2005, 39(4): 342-345.

HE Ming, FENG Boqin, MA Zhaofeng, et al. Rough set clustering algorithm based on entropy and information granularity [J]. Journal of Xi'an Jiaotong University, 2005, 39(4): 342-345.

MITRA S, BANKA H, PEDRYCZ W. Rough-fuzzy collaborative clustering [J]. IEEE Transactions on Systems, Man, and Cybernetics: Part B, 2006, 36(4): 795-805.

MAJI P, PAL S K. Rough set based generalized fuzzy C-means algorithm and quantitative indices [J]. IEEE Transactions on Systems, Man, and Cybernetics: Part B, 2007, 37(6): 1529-1540.

MAC PARTHALAIN N, SHEN Q. On rough sets, their recent extensions and applications [J]. Knowledge Engineering Review, 2010, 25(4): 365-395.

ZHOU T, ZHANG Y N, YUAN H J, et al. Rough K-means cluster with adaptive parameters [C]∥Proceedings of the Sixth International Conference on Machine Learning and Cybernetics. Piscataway, NJ, USA: IEEE, 2007: 3063-3068.

MITRA S. An evolutionary rough partitive clustering [J]. Pattern Recognition Letters, 2004, 25(12): 1439-1449.

周杨, 苗夺谦, 岳晓冬. 基于自适应权重的粗糙K均值聚类算法 [J]. 计算机科学, 2011, 38(6): 237-241.

ZHOU Yang, MIAO Duoqian, YUE Xiaodong. Rough K-means clustering based on self-adaptive weight [J]. Computer Science, 2011, 38(6): 237-241.

ZHOU J, PEDRYCZ W, MIAO D Q. Shadowed sets in the characterization of rough-fuzzy clustering [J]. Pattern Recognition, 2011, 44(8): 1738-1749.

FRANK A, ASUNCION A. UCI machine learning repository [EB/OL]. [2012-07-12]. http:∥archive.ics.uci.edu/ml.

LIKAS A, VLASSIS N, VERBEEK J J. The global K-means clustering algorithm [J]. Pattern Recognition, 2003, 36(2): 451-461.

谢娟英, 张琰, 谢维信, 等. 一种新的密度加权粗糙K-均值聚类算法 [J]. 山东大学学报: 理学版, 2011, 45(7): 1-6.

XIE Juanying, ZHANG Yan, XIE Weixin, et al. A novel rough K-均值聚类算法 [J]. 山东大学学报: 理学版, 2011, 45(7): 1-6.

XIE Juanying, ZHANG Yan, XIE Weixin, et al. A novel rough ans clustering algorithm based on the weight of density [J]. Journal of Shandong University: Natural Science, 2011, 45(7): 1-6.

DAVIES D L, BOULDIN D W. A cluster separation measure [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1979, 1(2): 224-227.

XIE X L, BENI G. A validity measure for fuzzy clustering [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1991, 13(8): 841-847.

HUBERT L, ARABIE P. Comparing partitions [J]. Journal of Classification, 1985, 2(2/3): 193-218.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

3D打印矩形粗糙通道内火箭煤油流动换热特性试验方法研究

一种基于流形距离的迭代优化聚类算法

基于聚类的多运行方式下电力系统稳定器设计

不同粗糙度条件下硅橡胶表面织构润滑特性的研究

特征保持的点云精简技术研究