期刊文献+

多数据流时间序列中的依赖模式发现算法研究

Research on The Structure Patterns of the Multiple Time Series
下载PDF
导出
摘要 针对多数据流组成的时间序列中发现有用的结构模式的MSDD算法不能很好地对节点剪枝,以及直观地表示模式的时间关系的问题,经过研究,提出了发现多数据流时间序列结构模式的算法:时间窗口移动筛选算法(TWMA).采用事件序列化的策略来发现多流时间序列中的依赖模式,与MSDD相比,在表示上更直观,发现模式的过程更灵活. It is very important to find the structure patterns from the multiple time series. A famous algorithm provided by Tim oates is the MSDD, it finds the dependency patterns by the dependency trees. The main problem is that it cant have a trim in times to the nodes, and it can't express the time relation clearly. A TWMA(Time Window Move Algorithm) algorithm is made to solve the above problems. It is more simple, clear, concision than the other algorithm by use of the fuzzy theory and the ideas of events serial. 
作者 王刚 吴代贤
出处 《西南师范大学学报(自然科学版)》 CAS CSCD 北大核心 2003年第4期547-549,共3页 Journal of Southwest China Normal University(Natural Science Edition)
  • 相关文献

参考文献8

  • 1陆玉昌.数据挖掘与知识发现[J].中国计算机用户,2000(18):29-29. 被引量:5
  • 2王刚 程小平.多流分段比较法发现多流时序的结构模式[A]..中国人工智能进展[C].北京:北京邮电大学出版社,2001.394—395.
  • 3何炎祥,石莉,张戈,黄浩,李超.时序模式的几种开采算法及比较分析[J].小型微型计算机系统,2001,22(5):601-607. 被引量:3
  • 4Tim Oates. Searching for Structure in Multiple Streams of Data [A]. The Thirteenth International Conference on Machine Learning [C].Italy: Barl, 1996. 346-354.
  • 5Agrawal R, Srikant R. Mining Sequential Patterns Research [M]. California: IBM Almaden Research Center, 1994. 1 - 12.
  • 6Agrawal R. Parallel Mining of Association Rules [M]. California: IBM Almaden Research Center, 2001. 1 -5.
  • 7Tim Oates, Paul R, Cohen. Parallel and Distribute Search for Structure in Multivariate Time Series [A]. ICML, Machine Learning ECML-97 [C]. Berlin, New York: Springer-Verlag, 1997. 1- 30.
  • 8Matthew D, Schmill, Tim Oates. A Distribute Approach to Finding Complex Dependencies in Data [A]. University of Massach Usetts,Center Computer Science Technical Report [C]. Massachusetts: Lederle Graduate Research Center, 1998. 1 -20.

二级参考文献3

  • 1[1]R. Agrawal,T. Imielinski. and A. Swami. Mining association rules between sets of items in large databases[C].In Proc.Of the ACM SIGMOD Conference on Management of Data. Washington,D. C.,May 1993.
  • 2[2]R. Agrawal and R. Srikant. Fast algorithms for mining association rules[C]. In Proc.Of the VLDB Conference, Santiago,Chile,September 1994. Expanded Version Available as IBM Research Report RJ 9839, June 1994.
  • 3[3]R. Agrawal and R. Srikant. Mining sequential patterns[R]. Research Report RJ 9910,IBM Almaden Research Center,San Jose,California,October 1994.

共引文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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