摘要
针对传统的密度聚类算法不能处理带有多约束条件的问题,在现有的密度聚类算法的基础上,提出了一个带有多约束条件限制的密度聚类算法。该算法将多约束条件引入到密度聚类分析中,并分析了多约束条件对聚类结果的影响。实验表明该算法在多约束条件下,可有效完成对数据点的聚类并且效果较好,为现实情况中处理多约束聚类提供了良好的理论支持。
Traditional clustering algorithms based on density can not overcome the shortage with a variety of constraints in the existing clustering algorithm based on the density proposed.This paper proposed a clustering algorithm based on density with a variety of constraints.The algorithm introduces a variety of constraints into clustering algorithm to analyze the clustering results affected by a variety of constraints.Experimental results show that the algorithm in a multi-constrained condition can complete a cluster analysis of the data points,and can obtain a better clustering results,provides a good theoretical support for really dealing with multiple constraints clustering.
出处
《计算机科学》
CSCD
北大核心
2011年第B10期143-145,164,共4页
Computer Science
关键词
多约束条件
密度
聚类
Multiple constraints limit
Density
Clustering