[1]杨永涛,李静.一种改进的K-means数字资源聚类算法[J].计算机技术与发展,2014,24(06):107-109.
　YANG Yong-tao[],LI Jing[].An Improved K-means Clustering Algorithm for Digital Resources[J].,2014,24(06):107-109.
点击复制

一种改进的K-means数字资源聚类算法()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
24
期数:
2014年06期
页码:
107-109
栏目:
智能、算法、系统工程
出版日期:
2014-06-30

文章信息/Info

Title:
An Improved K-means Clustering Algorithm for Digital Resources
文章编号:
1673-629X（2014）06-0107-03
作者:
杨永涛1; 李静2
1.燕山大学 信息化处,；2.燕山大学 信息科学与工程学院
Author(s):
YANG Yong-tao[1]; LI Jing[2]
关键词:
K-means算法; 数字资源; 相似度; 初始聚类中心
Keywords:
K-means clustering algorithm; digital resource; similarit; initial clustering center
分类号:
TP301.6
文献标志码:
A
摘要:
K-means聚类算法在数据挖掘聚类分析方法中是一个基本的、使用最广泛的划分算法。为了对数字图书馆中大量的数字资源进行更加有效、快速的聚类，文中针对传统的K-means算法存在的问题，结合数字图书馆数字资源的特征，提出了一种改进的基于关键词特征向量的初始聚类中心选择算法，并在此基础上对传统的K-means聚类算法进行了改进，用于对数字资源进行聚类，并进行了算法的实验验证。通过对实验结果的分析证明，文中提出的算法降低了数字资源聚类的代价，提高了聚类的效率，从而验证了算法的可行性。
Abstract:
K-means clustering algorithm is a basic analysis method in data mining closeting analysis,which is also the most widely used partitioning algorithm. In this paper,in order to get more fast and effective clustering result from large number of digital resources in digit-al library,aiming at the problems of the traditional K-means algorithm,combining with the features of the digital resources,an improved selection algorithm based on the keyword feature vector for initial clustering center is proposed. On this basis,the traditional K-means clustering algorithm is improved for digital resources clustering and experiment verification. The analysis results show that the algorithm proposed reduces the digital resources clustering cost,improves the clustering efficiency,verifying the feasibility of the algorithm.

相似文献/References:

[1]周育红 闫锋欣.数字资源跨平台整合系统的设计与实现[J].计算机技术与发展,2010,(01):239.
　ZHOU Yu-hong,YAN Feng-xin.Design and Implementation of a Cross-platform Digital Resource Integrated System[J].,2010,(06):239.
[2]耿筱媛 张燕平 闫屹.改进的K—means算法在电信客户细分中的应用[J].计算机技术与发展,2008,(05):163.
　GENG Xiao-yuan,ZHANG Yan-ping,YAN Yi.Application of Improved K - means Algorithm Subdivision of Telecom Clients[J].,2008,(06):163.
[3]黄韬 刘胜辉 谭艳娜.基于k-means聚类算法的研究[J].计算机技术与发展,2011,(07):54.
　HUANG Tao,LIU Sheng-hui,TAN Yan-na.Research of Clustering Algorithm Based on K-means[J].,2011,(06):54.
[4]周婷,张君瑛,罗成.基于Hadoop的K-means聚类算法的实现[J].计算机技术与发展,2013,(07):18.
　ZHOU Ting[],ZHANG Jun-ying[],LUO Cheng[].Realization of K-means Clustering Algorithm Based on Hadoop[J].,2013,(06):18.
[5]何聚厚,范文静.基于改进K-Means算法的教学反思文本聚类研究[J].计算机技术与发展,2013,(11):99.
　HE Ju-hou[],FAN Wen-jing[].Research on Text Clustering of Teaching Reflection Based on Improved K-Means Algorithm[J].,2013,(06):99.
[6]谢秀华,李陶深.一种基于改进PSO的K-means优化聚类算法[J].计算机技术与发展,2014,24(02):34.
[7]周爱武 于亚飞.K-Means聚类算法的研究[J].计算机技术与发展,2011,(02):62.
　ZHOU Ai-wu,YU Ya-fei.The Research about Clustering Algorithm of K-Means[J].,2011,(06):62.
[8]尹成祥 张宏军,张睿,綦秀利,等. 一种改进的K-Means算法[J].计算机技术与发展,2014,24(10):30.
　YIN Cheng-xiang,ZHANG Hong-jun,ZHANG Rui,et al. An Improved K-Means Clustering Algorithm[J].,2014,24(06):30.
[9]袁武,任勋益. 水平分割数据的保护隐私聚类挖掘方法研究[J].计算机技术与发展,2015,25(05):115.
　YUAN Wu,REN Xun-yi. Research on Privacy Preserving Clustering Method for Horizontal Partitioned Data[J].,2015,25(06):115.
[10]李振,贾瑞玉. 一种改进的K-means蚁群聚类算法[J].计算机技术与发展,2015,25(12):28.
　LI Zhen,JIA Rui-yu. An Improved K-means Ant Colony Clustering Algorithm[J].,2015,25(06):28.

更新日期/Last Update: 1900-01-01