Hesitant fuzzy sets (HFSs) are useful means to describe and deal with uncertain data. In this article, a minimal spinning tree (MST) algorithm based clustering technique under hesitant fuzzy environment is proposed. We first introduce the concepts of graph, MST, HFS, and hesitant fuzzy distance. Then, we present a hesitant fuzzy MST clustering algorithm to perform clustering analysis of HFSs via some hesitant fuzzy distances, and finally illustrate the effectiveness of our algorithm through two numerical examples.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.