摘要
针对序列模式的几个经典的算法的缺点,提出了一种基于时间约束序列模式的快速产生候选项的方法(TFEGC)。此算法不但避免了频繁的扫描数据库,还考虑了时间限制因素,避免了无用的候选序列的产生,提高了算法运行的时间效率。
The paper has several key algorithms reviewed briefly,puts forward their faults,and propose a new approach,called Fast Generation of Candidate-sequences for Time constraint Sequential Pattern Mining（TFEGC）,this algorithm doesn＇t need to scan the database frequently,and adds the time limit factor to the algorithm,avoids generating the candidate sequences which are not useful,improves the efficiency of the algorithm＇s running time.
出处
《微型机与应用》
2011年第10期69-72,共4页
Microcomputer & Its Applications
关键词
序列模式挖掘
时间约束
候选项
快速产生
sequential pattern
time constraint
candidate
fast generation
