期刊文献+

基于FP-Growth改进算法的云服务器故障数据分析 被引量:9

Analysis of cloud server fault data based on improved FP-Growth algorithm
下载PDF
导出
摘要 针对云服务器使用过程中参数异常的问题,介绍了云服务器的参数数据获取、数据清洗整理和有效分析过程。针对现有频繁模式增长(FP-Growth)算法中存在的条件FP-tree构建过程过于冗余以及数据量级越大处理效率越低的问题,提出了一种改进的FP-Growth算法,引入数组标记策略,每个FP-tree节点只保留指向父节点的指针。改进算法在挖掘过程中无需生成条件FP-tree,减少了时空消耗。实验结果表明,改进后的FP-Growth并行算法能够有效地提高云平台虚拟机异常数据的关联分析效率,并且改进算法也适用于较大规模数据集的数据挖掘工作。 In order to analyze the problem of abnormal parameters in the process of using the cloud server,the process of parameter data acquisition,data cleaning,and effective analysis of the cloud server is introduced.Aiming at the problems that the conditional FP-tree construction process is too redundant and the larger amount of data causes lower processing efficiency in the existing FP-Growth algorithm,an improved FP-Growth algorithm is proposed.It introduces the array tagging strategy,and each FP-tree node retains only pointers to the parent node.It does not need to generate a conditional FP-tree during the mining process,thus reducing time and space consumption.Experimental results show that the improved FP-Growth parallel algorithm can effectively improve the correlation analysis efficiency of abnormal data of cloud platform virtual machines,and is also suitable for data mining of large-scale data sets.
作者 何望 林果园 HE Wang;LIN Guo-yuan(School of Computer Science and Technology,China University of Mining and Technology,Xuzhou 221000;Digitization of Mine,Engineering Research Center of Ministry of Education of China,Xuzhou 221000,China)
出处 《计算机工程与科学》 CSCD 北大核心 2020年第5期770-775,共6页 Computer Engineering & Science
基金 中央高校基本科研业务费专项资金(2017XKQY079)。
关键词 云服务器 故障分析 FP-GROWTH算法 数据挖掘 cloud server fault analysis FP-Growth algorithm data mining
  • 相关文献

参考文献2

二级参考文献21

  • 1HAND D, MANNILA H, SMYTH P. Principles of Data Mining[ M]. Massachusetts Institute of Technology, 2001.
  • 2MANNIEA H. Methods and problems in data mining[ A]. Proceedings of the 6th International Conference on Database Theory[ C],1997.41 -55.
  • 3KRISHNAMURTHY R, IMIELINSKI T. Practitioner Problems in Need of Database Research: Research Directions in Knowledge Discovery[A]. Vol. 20, No. 3 of SIGMOD Record[ C], Sept. 1991.76-78.
  • 4HAN J, KAMBER M. Data Mining: Concepts and Techniuqes[ M].Morgan Kaufmann Publishers, San Francisco, CA, 2001.
  • 5AGRAWAL R, IMIELINSKI T, A. Swami. Mining association rules between sets of items in large databases[ A]. Proceedings of ACM SIGMOD International Conference on Management of data [ C],1993. 207-216.
  • 6AGRAWAL R, SRIKANT R. Fast algorithms for mining association rules[ A]. In J. B. Bocca, M. Jarke, and C. Zaniolo, editors, Proceedings of the 20th International Confererice on Very Large Database[C], MorganKaufmann, 1994. 487 -499.
  • 7PARK JS, CHEN MS, YU PS. An effective hash - based algorithm for mining association rules[ A]. Proceedings of ACM SIGMOD International Conference on Management of Data[ C], San Jose, CA,May 1995. 175 - 186.
  • 8TOIVONEN H. Sampling large databases for association rules[ A].Proceedings of the 22nd International Conference on Very Large Database[C], Bombay, India, September 1996. 134-145.
  • 9BRIN S, MOTWANI R, ULLMAN JD, TSUR S. Dynamic itemset counting and implication rules for market basket data[ A]. In Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data[ C], 1997. 255 -264.
  • 10SAVASERE A, OMIECINSKI E, NAVATHE S. An efficient algorithm for mining association rules in large databases[ R]. In 21st VLDB Conference, 1995.

共引文献12

同被引文献85

引证文献9

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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