| 序列模式挖掘算法综述 |
| |
| 引用本文： | 张长海,胡孔法,陈崚.序列模式挖掘算法综述[J].扬州大学学报(自然科学版),2007,10(1):41-46. |
| |
| 作者姓名： | 张长海 胡孔法 陈崚 |
| |
| 作者单位： | 扬州大学,信息工程学院,江苏,扬州,225009 |
| |
| 基金项目： | 国家自然科学基金;科技部科技基础条件平台建设计划;江苏省自然科学基金;江苏省高校"青蓝工程"优秀青年骨干教师资助项目;扬州大学"新世纪人才工程"优秀青年骨干教师基金 |
| |
| 摘 要： | 目前的主要序列模式挖掘算法可以分为3类:①基于Apriori的候选码生成-测试的方法;②基于垂直格式的候选码生成-测试的方法;③基于模式增长的方法.在介绍序列模式挖掘基本概念的基础上,描述了典型的挖掘算法,着重分析第②类序列模式挖掘算法的关键技术,并对各种算法进行详细的分析与比较,总结出它们的优缺点:前两类方法因产生巨大的候选序列而致挖掘代价剧增,而第③类模式增长方法避免了候选序列的产生,但挖掘长模式效率低.
|
| 关 键 词： | 序列模式挖掘 候选码生成-测试 数据分布f模式增长 |
| 文章编号： | 1007-824X（2007）01-0041-06 |
| 修稿时间： | 2006-10-31 |
Research on sequential pattern mining algorithms |
| |
| ZHANG Chang-hai,HU Kong-fa,CHEN Ling.Research on sequential pattern mining algorithms[J].Journal of Yangzhou University(Natural Science Edition),2007,10(1):41-46. |
| |
| Authors: | ZHANG Chang-hai HU Kong-fa CHEN Ling |
| |
| Institution: | Coil of Inf Engin, Yangzhou Univ, Yangzhou 225009, China |
| |
| Abstract: | Recently sequential pattern mining algorithms can be divided into three classes: a candidate generation-and-test approach based on Apriori,a candidate generation-and-test approach based on vertical format,a pattern-growth method.On the foundation of introduction of the basic concept of sequential pattern mining,this paper describes classical algorithms,place emphasis on analyzing pivotal technique of the second class algorithm,then makes a comparison and analysis among these algorithms and finally summarizes pros and cons of the algorithms: the first two methods generate too much candidates leading to high cost,while the method of pattern-growth avoids candidate.However,it is inefficient when mining long sequences. |
| |
| Keywords: | sequential pattern mining candidate generation-test data distribution pattern-grow |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
