现代电子技术2016，Vol.39Issue(14)：4-8,5.DOI:10.16652/j.issn.1004-373x.2016.14.002
一种基于增量式时间序列和最佳任务调度的W eb数据聚类算法
A Web data clustering algorithm based on incremental time series and optimal task scheduling
摘要
Abstract
In order to achieve fast clustering of Web service request data and improve accuracy of the clustering,a Web da⁃ta clustering algorithm based on incremental time series and optimal task scheduling is proposed in this paper. The Web data clustering definition in the time sequence and time series incremental clustering method are adopted in the algorithm. The com⁃plexity of Web data is reduced first in data compression form,and then the time series data clustering based on service time sim⁃ilarity is conducted. Finally,for the problem of the best service task scheduling in Web cluster services,the executive capacity of the server is taken as a standard to dispatch the service tasks. The simulation results show that in comparison with high⁃dimen⁃sional data grid⁃based hierarchical clustering algorithm and multi⁃objective fuzzy clustering algorithm based on incremental learn⁃ing,the algorithm proposed in this paper has obtained better results in the aspects of time clustering,clustering accuracy,suc⁃cess rate of all service execution and distortion degree.关键词
Web数据聚类/增量式时间序列/数据压缩/最佳任务调度Key words
Web data clustering/incremental time series/data compression/optimal task scheduling分类
电子信息工程引用本文复制引用
陈珂,柯文德,许波..一种基于增量式时间序列和最佳任务调度的W eb数据聚类算法[J].现代电子技术,2016,39(14):4-8,5.基金项目
国家自然科学基金（61272382）；广东省科技计划项目（2012B0101100037）；广东省高等学校科技创新资助项目 （）
