基于遗传算法和CLARANS的一种改进聚类算法  

An Optimized Clustering Algorithm Based on Genetic Algorithm and CLARANS

作　　者：刘琨[1] 周铁军[1] 

机构地区：[1]中南林业科技大学,湖南长沙410004

出　　处：《计算机与现代化》2008年第3期93-94,97,共3页Computer and Modernization

摘　　要：阐述了CLARANS(Clustering Large Applications based on RANdomized Search-基于随机搜索的大规模应用聚类)聚类算法的工作原理,同时为了解决CLARANS聚类挖掘算法效率低,费时长等问题,本文将遗传算法的思想引入CLAR-ANS算法,利用遗传算法的隐并行性对其进行改进,提出一种GA-CLARANS算法,有效地降低了聚类所花费的时间。实验证明GA-CLARANS算法在运行效率方面相比CLARANS算法有较好的表现,是可行且有效的。The theory of CLARANS is introduced, and an improved algorithm based on genetic algorithm is proposed to solve the problem that efficiency of CLARANS algorithm is low. The new algorithm is called GA-CLARANS. Simulation shows that this algorithm can solve the problem. It is feasible and efficient.

关 键 词：数据挖掘 聚类挖掘 遗传算法 CLARANS 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]