4.7 Article

Clustering algorithm for intuitionistic fuzzy sets

期刊

INFORMATION SCIENCES
卷 178, 期 19, 页码 3775-3790

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2008.06.008

关键词

intuitionistic fuzzy set (IFS); interval-valued intuitionistic fuzzy set (IVIFS); clustering algorithm; association coefficient; lambda-cutting

资金

  1. National Science Fund for Distinguished Young Scholars of China [70625005]
  2. National Natural Science Foundation of China [70571087, 70621061]

向作者/读者索取更多资源

The intuitionistic fuzzy set (IFS) theory, originated by Atanassov [K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems 20 (1986) 87-96], has been used in a wide range of applications, such as logic programming, medical diagnosis, pattern recognition, and decision making, etc. However, so far there has been little investigation of the clustering techniques of IFSs. In this paper, we define the concepts of association matrix and equivalent association matrix, and introduce some methods for calculating the association coefficients of IFSs. Then, we propose a clustering algorithm for IFSs. The algorithm uses the association coefficients of IFSs to construct an association matrix, and utilizes a procedure to transform it into an equivalent association matrix. The lambda-cutting matrix of the equivalent association matrix is used to cluster the given IFSs. Moreover, we extend the algorithm to cluster interval-valued intuitionistic fuzzy sets (IVIFSs), and finally, demonstrate the effectiveness of our clustering algorithm by experimental results. (c) 2008 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据