版权说明 操作指南
首页 > 成果 > 成果详情

Improvement of K-Means Clustering Algorithm with Better Initial Centers Based on Variance of Dimension

认领
导出
Link by 万方会议论文
反馈
分享
QQ微信 微博
成果类型:
会议论文
作者:
Jing Huang;Jianjun Li;Hao Tan
作者机构:
College of computer and Information Engineering,Central South University of Forestry and Technology,Changsha Hunan 410000,China
语种:
英文
关键词:
K-means Algorithm;Dimension Variance;Initialization Clustering Center;Accuracy
年:
2017
页码:
1-9
会议名称:
2015全国理论计算机科学学术年会
会议论文集名称:
2015全国理论计算机科学学术年会论文集
会议时间:
2015103
会议地点:
金华
会议赞助商:
中国计算机学会
机构署名:
本校为第一机构
院系归属:
计算机与信息工程学院
摘要:
  In this paper, a novel approach for initializing clustering centers of K-Means algorithm is presented.This method is based on the variance of dimension, which is used as keyword to make a full permutation.The results of the full permutation for the primary and secondary sequence of keyword is divided into k subsets to initialize the clustering centers.Four international datesets are used for testing datasets to test the effectiveness of this algorithm.And this algorithm is examined by numerical simulation.Experiments suggest that the initia...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com