一种有效的多关系聚类算法  

Efficient Multi-Relational Clustering Algorithm

作　　者：邓左祥[1,2] 李春贵[1] 

机构地区：[1]广西科技大学计算机科学与通信工程学院,广西柳州545006 [2]上海交通大学电子信息与电气工程学院,上海200240

出　　处：《微电子学与计算机》2016年第4期133-137,共5页Microelectronics & Computer

基　　金：国家自然科学基金(61462008;61472254;61420106010)

摘　　要：研究多关系数据挖掘的聚类问题,提出一种有效的多关系聚类算法EMC.EMC算法的目标是提高聚类的准确率,并且降低运行时间.EMC算法首先利用元组ID传播的思想,计算两个对象之间的相似度,接着利用K中心点聚类算法,将对象划分成簇.实验表明,EMC算法显著降低运行时间,并且提高聚类的准确率.The problem of clustering in multi-relation data mining was investigated, and an efficient multi-relational clustering algorithm called EMC was proposed. EMC aims at increasing the accuracy of clustering, and decreasing running time. First, EMC computed the similarity between two objects by taking advantage of tuple ID propagation approach. Then, EMC clustered the objects by K-medoids clustering algorithm. Performance results demonstrate that, EMC significantly decreases running time, and increases the accuracy of clustering.

关 键 词：多关系数据挖掘 聚类 元组ID传播 相似度 K中心点聚类算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]