.png){kind=icon}
返回
Vague C-means clustering algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2012.12.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A set of objectives are partitioned into groups by means of fuzzy set theory-based clustering approaches, which ignores the hesitancy introduced by the relationship degree between two entities. The interval-based membership generalization in vague sets (VSs) is more expressive than fuzzy sets (FSs) in describing and dealing with data vagueness. In this paper, we introduce a fuzzy clustering algorithm in the context of VSs theory and fuzzy C-means clustering (FCM), i.e., Vague C-means clustering algorithm (VCM). First, the objective function of VCM and the definition of interval-based membership function are given. Then, the QPSO (quantum-behaved particle swarm optimization)-based VCM calculation is proposed. Contrastive experimental results show that the proposed scheme is more effective and more efficient than FCM and three varieties of FCM, that is, FCM-HDGA, GK-FCM and KL-FCM. Besides, the paper also discusses the influence of the VCM parameters on the clustering results. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Fuzzy clustering
Vague set (VS)
Quantum-behaved particle swarm
optimization (QPSO)
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏Assessment of crop loss in peanut caused by Sclerotinia sclerotiorum, S. minor, and Sclerotium rolfsii in Argentina阿根廷花生因Sclerotinia sclerotiorum、S. minor和Sclerotium rolfsii引起的损失评估
PREAI
分享收藏
查看更多内容