一种动态调度的延迟敏感流网络挖掘算法-计算机工程与应用.pdf

Computer Engineering and Applications 计算机工程与应用 2016 ，52（15） 101 一种动态调度的延迟敏感流网络挖掘算法 刘华成，涂承胜 LIU Huacheng, TU Chengsheng 重庆三峡学院，重庆 万州 404000 Chongqing Three Gorges University, Wanzhou, Chongqing 404000, China LIU Huacheng, TU Chengsheng. Dynamic scheduling latency-sensitive stream network mining algorithms. Computer Engineering and Applications, 2016, 52 （15）：101-105. Abstract ：In order to improve the mining accuracy and energy efficiency of delay-sensitive data, a dynamic scheduling latency-sensitive stream network mining algorithm is proposed. First, the algorithm establishes stream mining system model, and analyses choose probability, energy consumption and latency-sensitive of classifier chain. Then, in order to control the delay time mining system and save energy, constraint equation based on energy minimization combination delay is proposed. At the same time, it uses an effective decomposition bound algorithm to solve the optimal processing speed of the classifier selection problem, and finally finds a combination of minimum energy equation boundary by greedy algorithm. Stream mining system maintains at a higher efficiency with the classification low energy consumption and latency. Simulation results show that compared with algorithm based on dynamic time warping algorithm and data mining algorithm based on genetic algorithm optimization of data, energy efficiency is increased by 39.4% and 41.4% , classification accuracy is increased by 11.5% and 5.9%, respectively, with better energy efficiency and excavation accuracy. Key words ：delay-sensitive traffic; stream mining system; mining algorithms; energy efficiency 摘 要：为了提高延迟敏感数据流的挖掘精度及能量效率，提出一种动态调度的延迟敏感流网络挖掘算法。该算法 建立了流挖掘系统模型，对分类器链的选择概率、能量消耗和延迟敏感进行分析。为了控制挖掘系统的延迟时间并节 省能量，提出了基于延迟约束的能量最小化组合方程。同时，采用了一个有效的分解定界算法来解决分类器的最佳 处理速度选择问题，通过贪婪算法找到组合方程的最小能量边界，实现流挖掘系统在具有更高的分类效率的同时保 持较低的能量消耗