郭淑红, 雷梁. 基于聚类的Web用户访问模式的算法研究[J]. 信阳师范学院学报(自然科学版), 2009, 22(1): 137-141.
引用本文: 郭淑红, 雷梁. 基于聚类的Web用户访问模式的算法研究[J]. 信阳师范学院学报(自然科学版), 2009, 22(1): 137-141.
GUO Shu-hong, LEI Liang. Research of the Cluster Algorithm based on Web Customer Access Model[J]. Journal of Xinyang Normal University (Natural Science Edition), 2009, 22(1): 137-141.
Citation: GUO Shu-hong, LEI Liang. Research of the Cluster Algorithm based on Web Customer Access Model[J]. Journal of Xinyang Normal University (Natural Science Edition), 2009, 22(1): 137-141.

基于聚类的Web用户访问模式的算法研究

Research of the Cluster Algorithm based on Web Customer Access Model

  • 摘要: 用户对Web站点的访问代表了用户对Web站点上页面的访问兴趣,这种兴趣程度可以通过用户对Web站点上页面的浏览顺序及页面上的浏览时间表现出来.通过对Web用户访问路径的分析,提出一种基于浏览路径及浏览时间的相似度的度量方法.然后,把粗糙度的概念引入Leader聚类算法中,提出粗糙Leader聚类算法.最后使用标准数据集进行了试验,证明基于此种相似度计算方法,应用粗糙Leader聚类算法Web用户的有效性.

     

    Abstract: The access of the users about a Web site represents the interest of users in the Web pages of the Web site.Each user s interest can be manifested by the sequence of each user access and access time in the Web.By analyzing the access path of Web user,similarity based on the sequence of each user access and access times can be put forward.Then,the concept of rough approximations is introduced in Leader cluster algorithm and the rough cluster algorithm based on Leader is suggested.Finally,the performance of th...

     

/

返回文章
返回