| 一种基于已存信息的序列模式挖掘更新方法 |
| |
| 引用本文： | 王新.一种基于已存信息的序列模式挖掘更新方法[J].计算机工程与应用,2006,42(4):171-173. |
| |
| 作者姓名： | 王新 |
| |
| 作者单位： | 云南民族大学数学与计算机科学学院,昆明,650031 |
| |
| 摘 要： | 在挖掘序列模式过程中,用户需要多次调整(增加或减少)最小支持度,才能从事务数据库中获得有趣序列模式。文章给出了一个利用已存信息有效产生大序列的PSI-seq算法,它能显著地减少每次扫描数据库时候选序列的计算,从而,提高挖掘的效率。
|
| 关 键 词： | 数据挖掘 序列模式 AprioriAll算法 PSI-seq算法 |
| 文章编号： | 1002-8331-（2006）04-0171-03 |
| 收稿时间： | 2005-06 |
| 修稿时间： | 2005-06 |
A Kind of Updating Method for Mining Sequential Patterns Based on Prestored Information |
| |
| Wang Xin.A Kind of Updating Method for Mining Sequential Patterns Based on Prestored Information[J].Computer Engineering and Applications,2006,42(4):171-173. |
| |
| Authors: | Wang Xin |
| |
| Affiliation: | School of Mathematics and Computer Science,Yunnan University of the Nationlities, Kunming 650031 |
| |
| Abstract: | In mining sequential patterns,a user may require to tune(increase or reduce) the value of the minimum support many times before a set of useful sequential patterns can be obtained from the transaction database.In this paper,an algorithm PSI-seq is given for efficient generation of large sequences using prestored information,It can significantly reduce the number of candidate sequences counted in each database scan.As a result,the efficiency of mining is improved. |
| |
| Keywords: | data mining sequential patterns AprioriAll algorithm PSI-seq algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
