کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1135118 | 956089 | 2012 | 11 صفحه PDF | دانلود رایگان |
In this paper, we investigate graph theory-based clustering techniques for Atanassov’s 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 (Algorithm I and Algorithm II). Then we extend Algorithm II for clustering IVIFSs, and show the effectiveness of our algorithms through some numerical experiments.
► Two intuitionistic fuzzy MST clustering algorithms have been proposed.
► One of the proposed algorithms has been further extended for clustering IVIFSs.
► The effectiveness of our algorithms have been verified through numerical experiments.
Journal: Computers & Industrial Engineering - Volume 62, Issue 4, May 2012, Pages 1130–1140