期刊文献+

扩展算法在频繁行为模式分析中的优化研究 被引量:1

Optimization research of scalability algorithm in frequent behavior pattern analysis
下载PDF
导出
摘要 对电子穿戴设备标准实时数据库进行频繁行为模式分析,主要通过多维度数据分析来获得更高的识别精度和识别效率.提出一种可扩展的频繁行为模式分析算法,先将采集数据转换为所定义的实体模式,对实体数据进行位置状态检测和时间转换的时空预处理;然后利用滑动窗口对时空预处理后的数据构建相似实体组,并过滤寿命周期过短的组来构建用户配置文件;最终实现模式分析识别.仿真结果表明,对比est Des+和Stream Mining两种算法,新算法能有效的提高频繁行为模式分析的识别精度和识别效率. The analysis of the frequent behavior patterns on standard database of electronic wearable devices is mainly through the multivariate data analysis to obtain higher identify accuracy and identify efficiency.This paper proposes a scalable algorithm for frequent behavior patterns analysis.The proposed algorithm first converts the collected entity data into a defined entity model,and performs spatio-temporal preprocessing on entity data of position state detection and time conversion; then,uses sliding window to construct the similar entity groups for the preprocessed data,and filters the groups with short lifetime to construct user profiles; finally,achieves pattern analysis and identification.Simulation results show that compare with est Des + and Stream Mining,new algorithm can effectively improve the identify accuracy and efficiency of the frequent behavior pattern analysis.
作者 刘云 黄亚飞 LIU Yun, HUANG Ya-fei(Faculty of Information Engineering and Automation, Kunming University of Science and Technology,Kunming 650500, Chin)
出处 《云南大学学报(自然科学版)》 CAS CSCD 北大核心 2018年第2期236-242,共7页 Journal of Yunnan University(Natural Sciences Edition)
基金 国家自然科学基金资助(61262040)
关键词 TPBP算法 频繁模式分析 预处理 多维时间数据 TPBP algorithm frequent pattern mining preprocessing multidimensional time data
  • 相关文献

参考文献3

二级参考文献26

  • 1HAN Jiawei, PEI Jian, YIN Yiwen. Mining frequent patterns without candidate generation[C]//Proceedings of the ACM SIGMOD International Conference on Management of Data. New York: ACM, 2000: 1-12.
  • 2DONG Jie, HAN Min. BitTableFI: an efficient mining frequent itemsets algorithm[J]. Knowledge-Based Systems, 2007, 20:329-335.
  • 3ZHANG Yan, ZHANG Fan, BAKOS J. Frequent itemset mining on large scale shared memory machines[C]//Proceedings of IEEE International Conference on Cluster Computing.Washington: IEEE Computer Society, 2011: 585-589.
  • 4TRAN A N, DUONG H V, TRUONG T C, et al. Efficient algorithms for mining frequent itemsets with constraint[C]//Proceedings of the 3rd International Conference on Knowledge and Systems Engineering (KSE). Washington: IEEE Computer Society, 2011: 19- 25.
  • 5TRAN A T, NGO T P, NGUYEN K A. An efficient algorithm for discovering maximum length frequent itemsets[C]//Proceedings of the 3rd International Conference on Knowledge and Systems Engineering (KSE). Washington: IEEE Computer Society, 2011: 62-69.
  • 6SURIYA S, SHANTHARAJAH S P. A hybrid k-DCI and Apriori algorithm for mining frequent itemsets[C]//Proceedings of 2013 International Conference on Circuits, Power and Computing Technologies (ICCPCT). Washington: IEEE Computer Society, 2013: 1059-1064.
  • 7VO B, COENEN F, LE T, et al. A hybrid Approach for mining frequent itemsets[C]//Proceedings of 2013 IEEE International Conference on Systems, Man, and Cybernetics. Washington: IEEE Computer Society, 2013: 4647-4651.
  • 8Aggarwal C C, Li Y, Wang J Y. Frequent pattern mining with uncertain data[C]//Proceedings of 15th ACM SIGKDD International Conference on Knowl- edge Discovery and Data Mining. New York.. Asso ciation for Computing Machinery, 2009:.
  • 9Chui C K, Kao B, Edward H, Mining frequent item- sets from uncertain data [C]// Proceedings of llth Pa- cific-Asia Coference on knowledge Discovery and Data Mining. Heidelberg: Springer Verlag, 2007.
  • 10Tang P Y, Erich A P. Mining probabilistic frequent closed itemsets in uncertain databases [C]// Pro- ceedings of 49th ACM Southeast Conference. New York: Association for Computing Machinery, 2011.

共引文献10

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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