基于半直觉模糊图的两种聚类分析算法

Two Kinds of Clustering Analysis Algorithm Based on Half Intuitionistic Fuzzy Graph

给出了半直觉模糊图传递闭包和最大生成树的概念;提出了基于半直觉模糊图传递闭包和最大相关树的两种聚类分析算法。讨论了算法的合理性,分析了算法的复杂度。结合实例,用这两种聚类分析算法做了基于半直觉模糊图聚类分析。结果显示算法合理高效。

The definition of transitive closure and maximum spanning tree of a half intuitionistic fuzzy graph is given. And then two kinds of clustering analysis algorithm are proposed based on transitive closure and maximum spanning tree of a half intuitionistic fuzzy graph. The rationality of the algorithms are discussed, and their complexity are analyzed. Combining with an example, we use the two clustering analysis algorithms for clustering analysis based on half intuitionistic fuzzy graph. The clustering analysis results show that the algorithm is reasonable and efficient.