期刊文献+

一种基于相关分析的局域最小二乘支持向量机小尺度网络流量预测算法 被引量:14

A local least square support vector machine prediction algorithm of small scale network traffic based on correlation analysis
原文传递
导出
摘要 本文分析了网络流量数据的特性,针对传统预测算法在预测网络流量时的缺陷提出了一种基于相关分析的相关局域最小二乘支持向量机(LSSVM)预测算法.算法在对训练数据重构相空间后,利用相关分析同时从距离相关和时间相关的训练样本中选择最优的训练子集,结合自适应参数优化的LSSVM预测模型对小尺度网络流量进行预测.通过选用实际情况下的网络流量数据对算法进行测试验证,结果显示本文所提算法不仅优于传统的全局预测算法,同时也优于各种改进的局域预测算法.算法不仅在预测精度上取得大幅的性能提升,同时能够通过留一交叉验证法在预测之前就完成预测模型和训练子集的优化. Real-time monitoring and forecasting technology for network tra?c has played an important role in network man-agement. Effective network tra?c prediction could analyze and solve problems before overload occurs, which significantly improves network availability. In this paper, after the vulnerability of traditional nonlinear prediction method in fore-casting modeling is analyzed, the relevant local (RL) forecast which is based on correlation analysis and the parameter optimization method based on pattern search (PS) is introduced. Using the correlation analysis, the optimal training subset is chosen from time-and distance-correlated training samples. On this basis, the prediction model is established by LSSVM. Finally network tra?c dataset collected from wired campus networks is studied for our experiments. And the results show that the relevant local LSSVM prediction method whose training set and parameters have been auto-matically optimized can effectively predict the small scale tra?c measurement data, and RL-LSSVM tra?c forecasting algorithm exhibits significantly good prediction accuracy for the data set compared with previous algorithm.
出处 《物理学报》 SCIE EI CAS CSCD 北大核心 2014年第13期49-58,共10页 Acta Physica Sinica
基金 国防科技预研项目(批准号:208010201)资助的课题~~
关键词 网络流量预测 混沌时间序列预测 最小二乘支持向量机 局域预测 network traffic prediction chaos time series forecasting least squares support vector machine local prediction
  • 相关文献

参考文献2

二级参考文献47

  • 1Lewis R M, Torczon V, Trosset M W. Direct search methods: then and now. Journal of Computational and Applied Mathematics, 2000, 124(1-2): 191-207.
  • 2Armijo L. Minimization of functions having Lipschitz continuous first partial derivatives. Pacific Journal of Mathematics, 1966, 16(1): 1-3.
  • 3Goldstein A A. Constructive Real Analysis. New York, NY.. Harper : Row, 1967.
  • 4Wolfe P. Convergence conditions for ascent methods. SIAM Review, 1969, 11(2): 226-235.
  • 5Spendley W, Hext G R, Himsworth F R. Sequential application of simplex designs in optimization and evolutionary operation. Technometrics, 1962, 4(4): 441-461.
  • 6Torczon V. Multi-directional search: A direct search algorithm for parallel machines [Ph. D. dissertationS. Depart ment of Mathematical Sciences, Rice University, Houston, TX, 1989.
  • 7Torczon V. On the convergence of pattern search algorithms. SIAM Journal on Optimization, 1997, 7(1): 1-25.
  • 8Audet C, Dennis J E. Analysis of generalized pattern searches. SIAM Journal on Optimization, 2003, 13(3) : 889-903.
  • 9Audet C, Dennis J E. Pattern search algorithms for mixed variable programming. SIAM Journal on Optimization, 2000, 11(3): 573-594.
  • 10Audet C, Dennis J E. Mesh adaptive direct search algorithms for constrained optimization. SIAM Journal on Optimization, 2006, 17(2): 188-217.

共引文献59

同被引文献128

引证文献14

二级引证文献98

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部