4.0 Article

Single-Valued Neutrosophic Minimum Spanning Tree and Its Clustering Method

期刊

JOURNAL OF INTELLIGENT SYSTEMS
卷 23, 期 3, 页码 311-324

出版社

WALTER DE GRUYTER GMBH
DOI: 10.1515/jisys-2013-0075

关键词

Neutrosophic set; single-valued neutrosophic set; minimum spanning tree; clustering algorithm; generalized distance measure

向作者/读者索取更多资源

Clustering plays an important role in data mining, pattern recognition, and machine learning. Then, single-valued neutrosophic sets (SVNSs) are a useful means to describe and handle indeterminate and inconsistent information, which fuzzy sets and intuitionistic fuzzy sets cannot describe and deal with. To cluster the data represented by single-value neutrosophic information, the article proposes a single-valued neutrosophic minimum spanning tree (SVNMST) clustering algorithm. Firstly, we defined a generalized distance measure between SVNSs. Then, we present an SVNMST clustering algorithm for clustering single-value neutrosophic data based on the generalized distance measure of SVNSs. Finally, two illustrative examples are given to demonstrate the application and effectiveness of the developed approach.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.0
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据