摘要
详细介绍了经典划分式聚类算法K-means的特点,针对该算法中"聚类中心难以确定"的不足提出"选择最优聚类质心"的改进方案,改进后的算法得到了可靠的聚类质心.最后,基于"中华网BBS"文本数据对改进后的算法进行验证、分析,并与经典K-means算法聚类结果进行对比,得到了更为理想的实验结果,表明算法可行有效.
Introducing the feature of classic clustering algorithm K-means of that "cluster centers is difficult to determine".I improved the program for the algorithm of "selecting the optimal clustering centroid",the improved algorithm has been a reliable the cluster centroid.Finally I got a data results to prove the improved algorithm is reliable.
出处
《首都师范大学学报(自然科学版)》
2015年第4期12-15,共4页
Journal of Capital Normal University:Natural Science Edition