改进的PrefixSpan算法在旅游热门路线上的应用  

Application of improved PrefixSpan agorithm on popular travel routes

作　　者：胡冰冰 芦俊丽 郑承宇 HU Bing-bing;LU Jun-li;ZHENG Cheng-yu(School of Mathematics and Computer Science,Yunnan Minzu University,Kunming 650500,China)

机构地区：[1]云南民族大学数学与计算机科学学院,云南昆明650500

出　　处：《云南民族大学学报（自然科学版）》2022年第1期94-102,共9页Journal of Yunnan Minzu University:Natural Sciences Edition

摘　　要：PrefixSpan算法是目前比较经典且较为高效的挖掘频繁序列模式的算法,而应用在旅游热门路线的搜索上,仍存在着连续性不足的问题.为了改善该算法的连续性,从改变频繁序列模式的生成过程方面对算法进行了改进优化.实验结果表明,改进的PrefixSpan算法在旅游热门路线的搜索上具有更好的连续性,且比原算法效率更高,更适用于旅游热门路线的搜索.Tourism,as an important part of social economy,plays an important role in promoting global economic growth.With the deep integration of Internet technology and tourism,the search and selection of tourist routes has gradually become a hot spot of algorithm application.PrefixSpan algorithm is a classic and efficient algorithm of mining frequent sequential patterns,and has been applied in popular travel routes search.However,it still exists the problem of insufficient continuity.In order to improve the continuity of PrefixSpan,this paper improves and optimizes the algorithm from the generation process of changing frequent sequence patterns.Experimental results show that the Improved PrefixSpan Algorithm has better continuity and is more suitable in the search of popular travel routes,and is more efficient than the original algorithm.

关 键 词：PREFIXSPAN算法 旅游路线推荐 数据挖掘 频繁序列模式 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]