一种旅行数据约束关联规则挖掘算法  

Constrained association rule mining algorithm for travel data

作　　者：吴斌[1] 马超[1] 

机构地区：[1]北京邮电大学计算机学院,北京100876

出　　处：《计算机工程与应用》2010年第20期129-132,137,共5页Computer Engineering and Applications

基　　金：国家自然科学基金No.60905025;国家自然科学基金重大研究计划项目No.90924029;国家科技支撑计划资助项目No.2006BAH03B05~~

摘　　要：随着旅游业的发展,从海量旅行数据中挖掘旅客类型和环境因素之间内在的、隐含的相关性,是分析旅游市场状况、预测对相关行业影响的一种有效方法。结合旅行数据特点,并针对现有约束方法的局限性,提出一种基于关系延展路径约束的关联规则并行挖掘算法。该算法有效结合MapReduce并行机制,在关系延展路径约束下生成事务集,提升后续并行效率;同时利用并行方法改进Apriori算法的逐层搜索,带来"二次"效率提升,从而更好更快地把握旅游业发展动态,调整旅游业宏观政策。With rapid development of the tourism industry,an effective approach emerges to analyze tourism market and predict the influence on the relative industries,which builds upon mining various types of travelers and inherent,hidden relativity among different environmental factors from the gigantic quantity of industrial data.This paper proposes a new association rule algorithm by combining the unique characters of tourism data based on available algorithms.The algorithm is a parallel data-mining algorithm,which is constrained by the available association rule.Meanwhile,it is also restricted by the new association rule mentioned above,called the association-extended route constraint,which can solve problems the old association rule can not.The algorithm which makes the proper use of the＂MapReduce＂parallel mechanism,can produce item sets under the association-extended route rule,and increase the after-parallel efficiency.At the same time,it can optimize the iterative search of th＂eApriori＂algorithm,bringing in th＂esecond＂efficiency improvement.So we can control the whole tourism industry, and adapt the macro industrial strategies more appropriate.

关 键 词：关系延展 路径约束 关联规则 并行计算 

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