Intuitionistic fuzzy MST clustering algorithms

详细信息	查看全文 | 推荐本文 |

• 作者：Hua Zhao^a ; ^b ; Zeshui Xu^b ; ^{xu_zeshui@263.net} ; Shousheng Liu^b ; Zhong Wang^b
• 关键词：Intuitionistic fuzzy set ; Minimum spanning tree ; Interval-valued intuitionistic fuzzy set ; Graph theory-based clustering algorithm ; Intuitionistic fuzzy distance
• 刊名：Computers and Industrial Engineering
• 出版年：2012
• 期刊代码：39_03608352
• 类别：et
• 出版时间：May, 2012
• 卷：62
• 期：4
• 页码：1130-1140
• 文件大小：404 K

摘要

In this paper, we investigate graph theory-based clustering techniques for Atanassov鈥檚 intuitionistic fuzzy sets (A-IFSs) and interval-valued intuitionistic fuzzy sets (IVIFSs). We start by introducing the concepts of graph, minimum spanning tree (MST), A-IFS, and intuitionistic fuzzy distance, and develop two intuitionistic fuzzy MST clustering algorithms (). Then we extend for clustering IVIFSs, and show the effectiveness of our algorithms through some numerical experiments.