欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对传统的聚类算法对数据集反复聚类,且在大型数据集上计算效率欠佳的问题,提出一种基于层次划分的最佳聚类数和初始聚类中心确定算法——基于层次划分密度的聚类优化（CODHD）。该算法基于层次划分,对计算过程进行研究,不需要对数据集进行反复聚类。首先,扫描数据集获得所有聚类特征的统计值;其次,自底向上地生成不同层次的数据划分,计算每个划分数据点的密度,将最大密度点定为中心点,计算中心点距离更高密度点的最小距离,以中心点密度与最小距离乘积之和的平均值为有效性指标,增量地构建一条关于不同层次划分的聚类质量曲线;最后,根据曲线的极值点对应的划分估计最佳聚类数和初始聚类中心。实验结果表明,所提CODHD算法与预处理阶段的聚类优化（COPS）算法相比,聚类准确度提高了30%,聚类算法效率至少提高14.24%。所提算法具有较强的可行性和实用性。
英文摘要：
The traditional clustering algorithms cluster the dataset repeatedly,and have poor computational efficiency on large datasets. In order to solve the problem,a novel algorithm based on hierarchy partition was proposed to determine the optimal number of clusters and initial centers of clusters,named Clusters Optimization based on Density of Hierarchical Division（ CODHD）. Based on hierarchical division,the computational process was studied,which did not need to cluster datasets repeatedly. First of all,all statistical values of clustering features were obtained by scanning dataset. Secondly,the data partitions of different level were generated from bottom-to-up,the density of each partition data point was calculated,and the maximum density point of each partition was taken as the initial center. At the same time,the minimum distance from the center to the higher density data point was calculated,the average of products＇ sum of the density of the center and the minimum distance was taken as the validity index and a clustering quality curve of different hierarchical division was built incrementally. Finally,the optimal number of clusters and the initial center of clusters were estimated corresponding to the partition of extreme points of curve. The experimental results demonstrate that,compared with Clusters Optimization on Preprocessing Stage（ COPS）,the proposed CODHD improved clustering accuracy by 30% and clustering algorithm efficiency at least 14. 24%. The proposed algorithm has strong feasibility and practicability.
同期刊论文项目
同项目期刊论文
期刊信息
位置：