机构地区: 中南大学信息科学与工程学院
出 处: 《湖南工业大学学报》 2008年第3期53-56,共4页
摘 要: 引入正向、逆向Markov一步状态转移概率矩阵构造序列数据库,并将逐层投影的PrefixSpan序列挖掘算法改为伪投影和隔层投影算法结合,以改进经典序列算法中存在的时间或空间开销太大的缺陷。性能分析表明,与经典算法相比,这种基于Markov链的Web访问序列模式挖掘新算法能够通过较少的计算量和空间复杂度获得较优的W e b访问序列模式。 The transition probability matrix to building sequence database of forward and backward Markov one-step state is introduced. Using pseudo projection combined with bi-level projection algorithm instead of level-by-level projection, it can improve classical sequence mining algorithms that usually have much time and space complexity properties. Performance shows that the proposed one can decrease time and space overhead while searching for Web accessing sequence pattern when compared with classical algorithm.
领 域: [自动化与计算机技术] [自动化与计算机技术]