期刊文献+

海量用户需求数据的高效预判筛选仿真 被引量:1

Efficient Pre Screening Simulation of Massive User Demand Data
下载PDF
导出
摘要 海量用户需求数据的高效预判筛选,有助于海量数据下的快速查询所需数据。由于用户需求的不同,使得产生的用户需求数据多样化。传统筛选方法主要通过对用户需求数据进行预处理,分析其特征属性,实现数据筛选,忽略了预判在数据筛选中的重要性,导致筛选结果精度低的问题。提出基于时间序列的海量用户需求数据预判筛选方法,以用户需求数据的高效预判筛选原理为基础,通过统计学理论对用户需求数据进行预测,基于K-Means算法确定用户需求数据间距离,采用支持向量机方法结合回归分析,对用户需求数据进行预判。利用影响用户需求的各种不规则因子对用于需求数据进行时间序列分析,得到数据序列,并计算用户需求数据个属性值,获得数据筛选各项权重值,完成海量用户需求数据高效预判筛选。仿真结果表明,采用上述方法进行用户需求数据预判筛选,其预判及筛选结果精度要优于传统方法,具有一定的优势。 The efficient prejudgment and screening of massive user demand data are conducive to the quick query of demand data in massive data.Due to the variety of data,the traditional method mainly analyzes the characteristic attribute,but ignores the importance of prejudgment in the data screening,leading to the low precision of result.In this paper,a method of prejudging and screening massive user demand data based on time series was proposed.Based on the efficient prejudgment and screening principle of user demand data,the user demand data was predicted by statistical theory.Based on K-Means algorithm,the distance between user demand data was determined.Moreover,the support vector machine method was combined with regression analysis to prejudge user demand data.In addition,various irregular factors influencing the user demand were used to analyze the time series of user demand data,so as to obtain the data sequence.Meanwhile,each attribute value of user demand data was calculated to obtain the weight value of data screening.Finally,efficient prejudgment and screening of massive user demand data was completed.Simulation results show that the proposed method for prejudging and screening user demand data is superior to the traditional method,which has some advantages.
作者 罗琼 林若钦 LUO Qiong;LIN Ruo-qin(South China Institute of Software Engineering,Guangzhou University,Guangzhou Guangdong 510990,China)
出处 《计算机仿真》 北大核心 2019年第12期374-377,共4页 Computer Simulation
关键词 用户需求 数据 高效 预判 筛选 User needs Data Efficient Prejudgment Screening
  • 相关文献

参考文献10

二级参考文献78

  • 1蒋盛益,谢照青,余雯.基于代价敏感的朴素贝叶斯不平衡数据分类研究[J].计算机研究与发展,2011,48(S1):387-390. 被引量:21
  • 2张引,陈敏,廖小飞.大数据应用的现状与展望[J].计算机研究与发展,2013,50(S2):216-233. 被引量:375
  • 3SINGLA S and MALIK A. Survey on various improved Apriori algorithms[J]. International Journal of Advanced Research in Computer and Communication Engineering, 2014, 3(11): 8528-8531.
  • 4MINAL G I and SURYAVANSHI N Y. Association rule mining using improved Apriori algorithm[J]. International Journal of Computer Applications, 2015, 112(4): 37-42.
  • 5RAJESWARI K. Improved Apriori algorithm A comparative study using different objective measures[J]. International Journal of Computer Science and Information Technologies, 2015, 6(3): 3185-3191.
  • 6ACHAR A, LAXMAN S, and SASTRY P S. A unified view of the Apriori-based algorithms for frequent episode discovery[J]. Knowledge & Information Systems, 2012, 31(2): 223-250.
  • 7AGRAWAL R and SRIKANT R. Fast algorithms for mining association rules[C]. VLDB’94 Proceedings of the 20th International Conference on Very Large Data Bases, San Francisco, CA, USA, 1994: 487- 499.
  • 8YANG Z, TANG W, SHINTEMIROV A, et al. Association rule mining-based dissolved gas analysis for fault diagnosis of power transformers[J]. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 2009, 39(6): 597-610.
  • 9ZHANG F, ZHANG Y, and BAKOS J D. Gpapriori: Gpu-accelerated frequent itemset mining[C]. 2011 IEEE International Conference on Cluster Computing, Austin, TX, USA, 2011: 590-594.
  • 10ANGELINE M D and JAMES S P. Association rule generation using Apriori mend algorithm for student’s placement[J]. International Journal of Emerging Sciences, 2012, 2(1): 78-86.

共引文献72

同被引文献5

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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