【24h】

Projected Rough Fuzzy c-means clustering

机译:投影粗糙模糊c均值聚类

获取原文

摘要

The conventional rough set based feature selection techniques find the relevant features for the entire data set. However different sets of dimensions may be relevant for different clusters. This paper introduces a novel Projected Rough Fuzzy c-means clustering algorithm (PRFCM) which employs rough sets to model uncertainty in data, and fuzzy set theory to compute the weights of dimensions applicable to individual clusters. We discuss the convergence of the proposed algorithm and present the results of applying the proposed approach to several UCI data sets to demonstrate that it scores over its competitors in terms of several quality and validity measures.
机译:基于常规粗糙集的特征选择技术会找到整个数据集的相关特征。但是,不同的维度集可能与不同的集群相关。本文介绍了一种新颖的投影粗糙模糊c均值聚类算法(PRFCM),它使用粗糙集对数据中的不确定性进行建模,并采用模糊集理论来计算适用于各个聚类的维数权重。我们讨论了所提出算法的收敛性,并提出了将所提出方法应用于几个UCI数据集的结果,以证明它在几种质量和有效性度量方面都超过了竞争对手。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号