一种基于Rough集的层次聚类算法  

A Rough Set-Based Hierarchical Clustering Algorithm

作　　者：刘少辉[1] 胡斐[2] 贾自艳[1] 史忠植[1] 

机构地区：[1]中国科学院计算技术研究所智能信息处理重点实验室,北京100080 [2]上海体育学院体育管理系,上海200438

出　　处：《计算机研究与发展》2004年第4期552-557,共6页Journal of Computer Research and Development

基　　金：国家自然科学基金项目 (60 173 0 17;60 0 73 0 19;90 10 40 2 1);北京市自然科学基金重点项目(4 0 110 0 3 )

摘　　要：Rough集理论是一种新型的处理含糊和不确定性知识的数学工具 ,将Rough集理论应用于知识发现中的聚类分析 ,给出了局部不可区分关系、个体之间的局部不可区分度和总不可区分度、类之间的不可区分度、聚类结果的综合近似精度等定义 ,在此基础上提出了一种基于Rough集的层次聚类算法 ,该算法能够自动调整参数 ,以寻求更优的聚类结果 实验结果验证了该算法的可行性 。Rough set theory is a new mathematical tool to deal with vagueness and uncertainty It has received considerable attention and has been applied in a variety of areas in recent years In this paper, rough set theory is applied to clustering analysis in knowledge discovery A lot of definitions such as the local indiscernibility relation, the local and total indiscernibility degree between two objects, the indiscernibility degree between two clusters and the integrated approximation rate of the clustering result are given Based on these definitions, a rough set based hierarchical clustering algorithm is proposed It can automatically adjust the parameter in order to get the more optimum result Some experiments are made on the data sets in UCI (University of California, Irvine) machine learning repository The experimental results show that the algorithm is feasible and has good clustering performance especially for symbolic attributes

关 键 词：ROUGH集 聚类 不可区分度 综合近似精度 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]