基于aco的web日志挖掘研究-管理科学与工程专业论文.docxVIP

  • 0
  • 0
  • 约5.57万字
  • 约 74页
  • 2019-01-09 发布于上海
  • 举报

基于aco的web日志挖掘研究-管理科学与工程专业论文.docx

基于aco的web日志挖掘研究-管理科学与工程专业论文

4·,gJ  ‘户 ‘户 , , ,bSE-- ‘ ‘』一 ◆做主要工作如下: ◆ 做主要工作如下: (1)利用用户浏览行为与蚁群觅食行为的相似性,提出一个新的概念“兴 趣信息素”来反映用户的访问兴趣度,利用访问兴趣度和选择偏爱度设计了基于 蚁群算法的群体用户浏览路径挖掘算法。实验结果表明该算法是切实可行的,利 用兴趣信息素确实能准确地反映用户浏览模式。 (2)在基本蚁群聚类模型基础上,从web用户特征、对象相似度、概率转 换函数三个方面对蚁群聚类算法进行了改进,给出了新的蚁群聚类算法 (ACCA)。 (3)增量式web用户聚类算法是在改进的蚁群聚类算法(ACCA)的基础 上提出的,它定义了用户聚类中心,同时引入聚类解体机制和聚类模型维护库, 确保增量式蚁群聚类算法能够得到高质量的聚类结果。实验表明,本文提出的增 量式蚁群聚类算法在处理大数据量方面克服了原来蚁群聚类算法的可伸缩性不 足的缺陷,同时,通过使用聚类模型维护库,使得增量式用户聚类算法在非常少 的时间内能够获得高质量的聚类效果。. 关键词:web日志挖掘;用户浏览模式;增量式用户聚类;蚁群算法;蚁群聚 类 .、 .比 - need need to find out customers’interests and hobbies,discover users’accessing mode.and design personalized sites which satisfy the needs of different customers’groups,and this is the objective which every commercial site pursue.The method of web log mining Can help to achieve this goal. Under the above background,the thesis studied web log mining based on ACO (ant colony Optimization algorithm),the main works are as follow: (1)By using the similarity between users’ browsing behavior and ant foraging behavior,the thesis brings forward a new concept of”interest pheromone”to reflect ◆ users’ browsing interest degree,by the use of browsing interest degree and select preference degree,this thesis designed a group users’browsing path algorithm based on ant colony algorithm.Experimental results show that the algorithm is feasible, using interest pheromones Can accurately reflect users’browsing mode. (2)On the basis of basic ant colony clustering model,it improved the ant colony clustering algorithm from three aspects:characteristics of web users,similarity between obj ects,probability conversion function. (3)Incremental web user clustering algorithm was brought forward on the basis of an improved ant colony clustering algorithm(ACCA),it defines the user clustering center,at the same time introduces clustering disintegration mechanism and clustering models maintenance library to ensure that the incremental ant colony clustering algorithm Can get hi曲-quality clustering result

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档