Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 62, Issue 4, Pages 1130-1140Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2012.01.007
Keywords
Intuitionistic fuzzy set; Minimum spanning tree; Interval-valued intuitionistic fuzzy set; Graph theory-based clustering algorithm; Intuitionistic fuzzy distance
Funding
- National Natural Science Foundation of China [71071161]
- National Science Fund for Distinguished Young Scholars of China [70625005]
- Pre-Research Foundation of PLA University of Science and Technology [20110511]
Ask authors/readers for more resources
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 (Algorithms I and II). Then we extend Algorithm II for clustering IVIFSs, and show the effectiveness of our algorithms through some numerical experiments. (C) 2012 Published by Elsevier Ltd.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
