期刊文献+

基于用户兴趣迁移的Web日志仿真生成算法 被引量:2

Simulation generating algorithm of Web log based on user interest migration
下载PDF
导出
摘要 针对仿真生成算法采用静态分布模型生成Web日志,会造成与真实数据之间存在较大差异的问题,提出一种基于用户兴趣迁移的Web日志仿真生成(WLSG)算法。该算法首先对Web日志与时间的关系进行了建模;其次,模拟了用户在不同时间访问文件时用户的兴趣迁移;最后,也模拟了用户自适应访问当前时刻最感兴趣的文件。相对于现有的采用静态分布模型的仿真算法,所提算法能够提高自相似性指标约2.86%。实验结果表明,该算法通过用户的兴趣迁移来改变用户的访问序列,能够较好地模拟真实Web日志,有效地应用于Web日志的仿真生成。 When the existing simulation generation algorithm uses the distribution of the static model to generate a Web log, there is a big difference with real data. In order to solve the problem, a new algorithm of Web Log Simulation Generation based on user interest migration (WLSG) was proposed. Firstly, the relationship between Web log and time was modeled. Secondly, the migration of user interest was simulated when the user accessed to the file in different time. Finally, it was also simulated that the user adaptively access to the file which he was most interested in at the current moment. Compared with the distribution of the existing static model, the proposed algorithm had significantly improved the self-similarity by about 2.86% on average. The experimental results show that, the proposed algorithm can well simulate Web log by user interest in migration to change user access sequence, which is capable of being effectively applied in the Web log simulation generation.
出处 《计算机应用》 CSCD 北大核心 2016年第12期3476-3480,3504,共6页 journal of Computer Applications
基金 福建省高校产学合作项目(2016H6007)~~
关键词 兴趣迁移 时间序列 日志分析 自相似 仿真生成 interest migration time series log analysis self-similarity simulation generation
  • 相关文献

参考文献2

二级参考文献12

  • 1KAPOOR K, SUBBIAN K, SRIVASTAVA J, et al. Just in time rec- ommendations: modeling the dynamics of boredom in activity streams [ C]//WSDM'15: Proceedings of the 8th ACM International Confer- ence on Web Search and Data Mining. New York: ACM, 2015: 233 - 242.
  • 2GU W, DONG S, ZENG Z. Increasing recommended effectiveness with Markov chains and purchase intervals [ J]. Neural Computing and Applications, 2014, 25(5): i153 -1162.
  • 3BAUER J, NANOPOULOS A. Recommender systems based on quantitative implicit customer feedback [ J]. Decision Support Sys- tems, 2014, 68:77-88.
  • 4SALAKHUTDINOV R, MNIH A. Probabilistic matrix factorization [ C]/! Proceedings of the 2008 Annual Conference on Neural Infor- mation Processing Systems 20. Cambridge: MIT Press, 2008:1257 - 1264.
  • 5SALAKHUTDINOV R, MNIH A. Bayesian probabilistic matr/x fac- torization using Markov chain Monte Carlo [ C]// ICML'08: Pro- ceedings of the 25th International Conference on Machine Learning. New York: ACM, 2008:880 -887.
  • 6ZHOU T, SHAN H, BANE1LIEE A, et al. Kernelized probabilistic matrix factorization: exploiting graphs and side information [ C]// Proceedings of the 12th SIAM International Conference on Data Min- ing. Philadelphia: SIAM, 2012:403-414.
  • 7FREUND Y, SCHAPIRE R E. A decision-theoretic generalization of on-line learning and an application to boosting [ J]. Journal of Com- puter and System Sciences, 1997, 55(1) : 119 - 139.
  • 8FREUND Y, IYER R, SCHAPIRE R E, et al. An efficient boos- ting algorithm for combining preferences [ J]. Journal of Machine Learning Research, 2003, 4(6): 933-969.
  • 9SCHAPIRE R E, FREUND Y, BARTLETT P, et al. Boosting the margin: a new explanation for the effectiveness of voting methods [J]. The Annals of Statistics, 1998, 26(5) : 1651 - 1686.
  • 10MIWA S, HIRAI T, SUMI K. Robust face detection using one-class estimation and real AdaBoost [ J]. Electronics and Communications in Japan, 2014, 97(7): 39-47.

共引文献3

同被引文献23

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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