| 摘要: |
| 在现有的数据流频繁模式挖掘算法中,批处理方法平均处理时间短,但需要积攒足够的数据,使得其实时性差且查询粒度粗;而启发式方法可以直接处理数据流,但处理速度慢.提出一种改进的字典树结构--IL-TREE(improved lexicographic tree),并在其基础上提出一种新的启发式算法FPIL-Stream(frequent pattem mining based on improved lexicographic tree),在更新模式和生成新模式的过程中,可以快速定位历史模式.算法结合了倾斜窗口策略,可以详细记录历史信息.该算法在及时处理数据流的前提下,也降低了数据的平均处理时间,并且提供了更细的查询粒度. |
| 关键词: 数据挖掘 数据流 频繁模式 倾斜窗口 |
| DOI： |
| 分类号: |
| 基金项目:Supported bytheNationalNatural Science Foundation of China under Grant Nos.60473073,60573090,60503036(国家自然科学基金) |
|
| A High-Speed Heuristic Algorithm for Mining Frequent Patterns in Data Stream |
|
ZHANG Xin,LI Xiao-Guang,WANG Da-Ling,YU Ge
|
| Abstract: |
| Of the current approaches to frequent pattern discovery in stream data, the batch approach requires enough data, while the heuristic approach can deal with stream data directly. Although the average speed of the batch approach is higher, it cannot response on time and the query granularity is rough. This paper proposes an improved Lexicographic tree, IL-TREE (improved lexicographic tree), and gives a novel heuristic algorithm, called FPIL-Stream (frequent pattern mining based on improved lexicographic tree), which locates the historical patterns rapidly in the stage of updating the patterns and generating the new ones. Moreover, a policy for the titled window is integrated into the algorithm for recording the historical information in details. With the promise of the processing stream data on time, the algorithm reduce the average processing time greatly and provides a finer granularity of query. |
| Key words: data mining data stream frequent pattern tilted window |
