基于区间数贴近度的最大树聚类算法研究  

A Study of the Maximum Tree Clustering Algorithm Based on Interval Number Approach

作　　者：郭丽[1] 刘国峰[1] 包玉娥[1] 

机构地区：[1]内蒙古民族大学数学学院,内蒙古通辽028043

出　　处：《内蒙古民族大学学报（自然科学版）》2014年第4期384-387,共4页Journal of Inner Mongolia Minzu University：Natural Sciences

基　　金：内蒙古自然科学基金资助项目(2010MSD114)

摘　　要：针对特征指标和权重指标均为区间数的多指标信息聚类问题,在传统的数值信息最大树聚类法的基础上,给出了基于区间数的多指标信息聚类问题的一种具体算法.在此过程中,加权相似矩阵的提出克服了属性权重对聚类产生的双重影响;并通过引入相对贴近度的概念,对相似区间进行排序.最后,通过实例验证了此算法的有效性.With respect to the problems of which both the characteristic values and weights of indices are uncertain interval numbers, based on the traditional maximum tree clustering method, this paper provides a clustering algorithm based on the clustering problem of multiple indicators. In this process,the proposed weighted similar matrix overcomes the double impact which attribute weights generated to the clustering results,and we sort the similar interval numbers by introducing the conception of the relative approach degree. Finally, we demonstrate the effectiveness of this algorithm by an example.

关 键 词：区间数 贴近度 最大树聚类法 

分 类 号：O223[理学—运筹学与控制论]