检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机科学》2003年第2期163-164,共2页Computer Science
基 金:国家自然科学基金(60174021)
摘 要:This paper proposes a K-Means clustering method based on genetic algorithm. We compare our method with the traditional K-Means method and clustering method based on simple genetic algorithm. The comparison proves that our method achieves a better result than the other two. The drawback of this method is a comparably slower speed in clustering.This paper proposes a K-Means clustering method based on genetic algorithm. We compare our method with the traditional K-Means method and clustering method based on simple genetic algorithm. The comparison proves that our method achieves a better result than the other two. The drawback of this method is a comparably slower speed in clustering.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222