作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (9): 217-219. doi: 10.3969/j.issn.1000-3428.2009.09.076

• 人工智能及识别技术 • 上一篇    下一篇

基于PageRank算法改进的元胞自动机模型

吴小兰   

  1. (安徽财经大学信息工程学院,蚌埠 233041)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-05-05 发布日期:2009-05-05

Improved Cellular Automata Model Based on PageRank Algorithm

WU Xiao-lan   

  1. (Department of Information Engineering, Anhui University of Fiance and Economics, Bengbu 233041)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-05-05 Published:2009-05-05

摘要: 针对在线零售业务系统中用户要进入许多无关页面才能找到所需商品的问题,站点应能根据群体用户购买兴趣动态调整网页分配,即站点自适应。借用PageRank算法对元胞自动机模型进行改进,实现站点的自适应调整。与原模型相比,改进模型的演化规则简单、时间复杂度低、性能更优越。

关键词: 元胞自动机, PageRank算法, Web数据挖掘, 自适应站点

Abstract: In online retail, the conflict between the different interests of all customers to different commodities and the commodity classification structure of Web site will make customers access overabundant Web pages. To solve this problem, the data about the customers’ interests are mined to make the Web site adjust its structure, which is adaptive site. Based on improvement of the cellular automaton model using the PageRank algorithm, it achieves the adaptive adjustment and spents less time.

Key words: Cellular Automata(CA), PageRank algorithm, Web data mining, adaptive site

中图分类号: