基于信息熵的粗糙K-prototypes聚类算法
欧阳浩;戴喜生;王智文;王萌
【期刊名称】《计算机工程与设计》 【年(卷),期】2015(000)005
【摘要】The traditional K-prototypes fail to concern the degree that every category attribution effecting clustering results,and they are easily disturbed by noise and can not deal with these uncertain problems including inaccuracy and incompleteness.To solve these faults,an entropy based rough K-prototypes clustering algorithm was provided.Firstly,using entropy theory,the weight of every category attribution for clustering result was got,and then using rough theory,the rough dissimilarity degree be-tween every sample and every rough model was calculated.Through multi iterative calculations,the final clustering results were got.The new method combines information entropy theory and rough set theory,which can differentiate every category attribu-tion and cope with uncertain problems caused by inaccuracy data.Results of experiments on four UCI data sets show the algo-rithm is effective.%针对传统K-prototypes在计算分类属性的差异度时未考虑各个分类属性对聚类结果的影响程度，且算法容易受到噪声的干扰，无法处理数据中不够精确、不完整等不确定性问题，提出基于信息熵的粗糙K-prototypes聚类算法。在计算数据样本之间分类属性的差异度时，使用信息熵的理论，确定每个分类属性对于聚类分析结果的影响权重；引入粗糙理论，计
基于信息熵的粗糙K-prototypes聚类算法
