摘要
基于频繁序列模式压缩技术的网站结构优化算法旨在发现用户在浏览过程中频繁访问的序列关联,为优化站点结构提供有力的依据。分析了现有频繁模式聚类算法的不足,提出了在模式聚类函数的基础上生成一个压缩的偏序(Partial Order)的算法,实验结果显示该算法可以对频繁序列模式进行高效、高质量的压缩,可以得到数量更少、信息量更大的模式,从而提高发现的频繁访问序列的兴趣性。
In this article,Website structure optimization based on frequent sequential pattern compression method is to discover the sequence association in course of the frequently visited pages,which can help us to optimize the site topology.After analyzing the shortages of the existing algorithms for frequent pattern clustering,proposes an algorithm for creating compressed partial order based on pattern clustering function, Experiment result shows the compression arithmetic has higher proficiency and qualify,also can obtain much less number and much more information pattern.Thereby can find out more interesting of visited frequent sequential than the normal algorithm.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第30期133-135,共3页
Computer Engineering and Applications
关键词
数据挖掘
频繁序列模式
压缩
WEB设计
data mining
frequent sequential pattern
compression
Web design
