期刊文献+

抽样技术在序列模式增量更新中的应用 被引量:2

The application of sample in incremental update of sequence pattern
在线阅读 下载PDF
导出
摘要 在这篇文章中,我们提出了一种应用抽样的技术于序列挖掘的算法。这个方法能在原始数据库和更新后的数据库之间评价序列模式的变化。评价了序列模式的变化我们能决定何时使用精确的挖掘算法或增量算法:如果变化达到一定程度,就使用精确的方法以挖掘新的序列模式;如果变化比较小,则在一定的可信度情况下,就使用原来的模式,且误差能控制在一定的范围内。 In this paper, we use sample method into sequence pattern mining and devise a algorithm. This method can estimate the changes of patterns in a database when it is updated. When we estimate the changes of patterns, we can make a decision about the time to use an exact mining algorithm or an incremental algorithm: if the changes reach a certain degree, exact method will be used in order to mine new sequence patterns; if the change is little, we can use the original patterns under a certain reliability, and the error can be controlled in certain bound.
出处 《微计算机信息》 北大核心 2006年第08X期4-6,共3页 Control & Automation
基金 国家科技成果重点推广项目(No.2003EC000001)
关键词 抽样 数据挖掘 序列 置信区间 sample, data mining, sequence, confidence interval
  • 相关文献

参考文献8

  • 1Rakesh Agrawal, Ramakrishnan Srikant. Mining sequential pattern. ICDE,1995
  • 2S.D.Lee,David W.Cheung,Ben Kao. ls Sampling Useful in Data Mining? A Case in the Maintenance of Discovered Association Rules.
  • 3David W.Cheung,Jiawei Han,Vincent T.Ng,C.Y.Wong. Maintenance of Discovered Association Rules in Large Databases:An Incremental Updating Technique.
  • 4David W.Cheung,S.D.Lee,Benjamin Kao. A General Incremental Technique for Maintaining Discovered Association Rules
  • 5Qingguo Zheng,Ke Xu,Shilong Ma, Weifeng Lv.The Algorithms of Updating Sequential Patterns.
  • 6F.Masseglia, P.Poneelet, M.Teisseire. Incremental Mining of Sequential Patterns in Large Databases.
  • 7陈凯,冯全源.基于矩阵伪投影策略的频繁项集挖掘方法[J].微计算机信息,2005,21(11X):85-87. 被引量:8
  • 8邹翔,张巍,蔡庆生,王清毅.大型数据库中的高效序列模式增量式更新算法[J].南京大学学报(自然科学版),2003,39(2):165-171. 被引量:10

二级参考文献23

  • 1R. Agrawal, and R. Srikant. Fast Algorithms for Mining Association Rules [A]. In Proceeding of the 20th VLDB Conferencei [C], Santiago,Chile, 1994.
  • 2A. Silbersehatz, and A. Tuzhilin. What Make Patterns Interesting in Knowledge Diseovery Systems [J]. In IEEE Transaetion on Knowledge and Data Engineering, Dec. 1996.
  • 3J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation [A]. In Proceeding of ACM SIGMOD" 00 [C], May. 2000.
  • 4M. J. Zaki, and C. Hsiao. CHARM: An Efficient Alogrithm for Closed Itemset Mining [A]. In SDM" 02 [C], Apr. 2002.
  • 5L. Li, and F. Jin. A New Algorithm form Mining Frequent Pattern [A].Journal of Southwest Jiaotong University, May. 2002.
  • 6J. Han and M. Kamber. Data Mining: Concepts and Techniques [M].Morgan Kaufmann Publishers, San Francisco, CA, 2001.
  • 7Agrawal R, Srikant R. Mining sequential patterns. Proceedings of the International Conference on Data Engineering. IEEE Computer Society, 1995: 3-14.
  • 8Agrawal R, Srikant R. Mining sequential patterns: Generalizations and performance improvements.Proceeding of the International Conference on Extending Database Technology. New York: Springer-Verlag, 1996: 3-17.
  • 9Bettini C, Sean Wang X, Jajodia S. Mining temporal relationships with multiple granularities in time sequences. Data Engineering Bulletin, 1998, 21: 32-38.
  • 10Ozden B, Ramaswamy S, Silberschatz A. Cyclic association rules. Proceedings of the International Conference on Data Engineering. IEEE Press, 1998: 412-421.

共引文献15

同被引文献8

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部