摘要
针对常规动态聚类方法对初始聚类中心的敏感性以及聚类结果与样本输入次序有关等问题,本文另辟蹊径,提出了一种基于GA 的动态聚类方法,并将它应用到数据库的数据分析中. 计算结果表明,该方法是一个具有全局最优解的动态聚类方法,其结果明显好于K-均值聚类算法.
To solve the problem of sensitivity with the original clustering center and clustering results depended on the order of the input example in common dynamic clustering algorithm, a new dynamic clustering method based on genetic algorithms is presented in this paper and is applied to data analysis in databases. Computing results indicate that the method is a dynamic clustering algorithm with global optimization and is superior to \$K\|\$ means algorithm.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
1999年第10期108-110,116,共4页
Systems Engineering-Theory & Practice
基金
国家自然科学基金
关键词
遗传算法
动态聚类
数据分析
数据库
genetic algorithms
dynamic clustering
global optimization
data analysis