期刊文献+

基于经验模态分解的大数据波束形成方法

Beamforming Method Based on Empirical Mode Decomposition
下载PDF
导出
摘要 通过对大数据进行波束形成处理,提高大数据的挖掘和聚类能力,传统方法采用模糊C均值聚类进行大数据波束形成,抗干扰性能不强,提出一种基于经验模态分解的大数据波束形成方法。首先分析的大数据的数据结构和时间序列处理模型,然后通过经验模态分解实现对大数据序列的特征提取和波束形成。仿真结果表明,采用该方法进行大数据波束形成处理,提高了大数据挖掘和聚类性能,收敛性和抗干扰性较好。 Through the large data processing, improve the data mining and clustering ability. In the traditional method, the large data beamforming method based on empirical mode decomposition is proposed by using the fuzzy C means clustering to improve the data mining and clustering ability. The data structure and time series processing model of large data is analyzed, and then the feature extraction and beamforming of large data sequence are realized by empirical mode decomposition. The simulation results show that the method is used to deal with large data beamforming, which improves the performance of large data mining, clustering performance, convergence and better anti-interference.
作者 曲鸣飞 辛义
出处 《世界有色金属》 2015年第12期122-123,共2页 World Nonferrous Metals
基金 "促进人才培养(师资队伍建设)-电气自动化技术教学团队(CJRC-SZDW-2015/001/002)"项目资助
关键词 大数据 经验模态分解 波束形成 large data empirical mode decomposition beamforming
  • 相关文献

参考文献4

二级参考文献56

  • 1颜跃进,李舟军,陈火旺.基于FP-Tree有效挖掘最大频繁项集[J].软件学报,2005,16(2):215-222. 被引量:68
  • 2Agrawal R, Imielinski T, Swami A. Mining association rules be- tween sets of items in large database[ A]. Proc of ACM SIGMOD Conference on Management of Data[ C ]. New York: ACM Press, 1993:207-216.
  • 3Han J, Pei J, Yin Y. Mining frequent patterns without candidate generation[ A]. Proc of ACM SIGMOD International Conference on Management of Data [ C ]. New York: ACM Press, 2000,29 (2) :1-12.
  • 4Zaki M J. Scalable algorithms for association mining [ J]. IEEE Transactions on Knowledge and Data Engineering,2000, 12 (3): 372 -390.
  • 5Aggarwal C C, Li Yan, Wang Jian-yong, et al. Frequent pattern mining with uncertain data[ A]. Proc of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining [C]. New York: ACM Press, 2009:29-38.
  • 6Zhang Qin, Li Fei-fei, Yi Ke. Finding frequent items in probabi- listic data [ A]. Proc of ACM SIGMOD International Conference on Management of Data[ C]. New York: ACM Press, 2008.
  • 7Calders T, Carboni C, Goethals B. Efficient pattern mining of un- certain data with sampling [ C]. Proc of the 14th Pacific-Asia Con- ference on Knowledge Discovery and Data Mining, 2010:480-487.
  • 8Chui C K, Kao B, Hung E. Mining frequent itemsets from uncer- tain data [ C ]. Proc of the 11 th Pacific-Asia Conference on Knowl- edge Discovery and Data Mining, 2007:47-58.
  • 9Zaki M, Gouda K. Fast vertical mining using diffset [A]. Proc of Ninth ACM SIGKDD International Conference on Knowledge Dis- covery and Data Mining [ C ]. New York: ACM Press, 2003 : 26- 335.
  • 10Abiteboul S, Kanellakis P, Grahne G. On the representation and querying of sets of possible worlds [ A]. Proc of ACM SIGMOD Conference on Management of Data[ C]. New York: ACM Press, 1987,16(3) :34-48.

共引文献131

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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