Clustering algorithm for intuitionistic fuzzy sets

  • Authors:

  • Zeshui Xu;Jian Chen;Junjie Wu

  • Affiliations:

  • Antai School of Economic and Management, Shanghai Jiaotong University, Shanghai 200052, China;School of Economics and Management, Tsinghua University, Beijing 100084, China;School of Economics and Management, Beihang University, Beijing 100083, China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2008

Quantified Score

Hi-index 0.09

Visualization

Abstract

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 @l-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.