4.7 Article

Clustering algorithm for intuitionistic fuzzy sets

Journal

INFORMATION SCIENCES
Volume 178, Issue 19, Pages 3775-3790

Publisher

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

Keywords

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

Funding

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

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available