期刊文献+

基于自相关获取周期的时间序列模式挖掘算法 被引量:5

Time Sequence Mining Algorithm Based on Autocorrelated Period Obtaining
下载PDF
导出
摘要 文章针对局域网通话流量监测数据,提出了一种新的基于时间序列自相关的关联规则挖掘方法。该方法通过对数据进行平滑处理、求自相关函数,从而确定信号的周期;通过动态阈值对时间序列进行压缩处理提取流量趋势序列,提出DS-MMFI算法完成序列模式的挖掘。结果表明此算法能够有效去除时间序列的波动,且序列模式挖掘结果符合实际通信特征。 The article is based on the actual data of a local area network call traffic, it proposes a new association rule mining algorithm based on time-series by autocorrelation. The method determines the signal cycle by smoothing and finding the autocorrelation function. To get traffic trends sequence, it uses the dynamic threshold for the compression of time-series. It completes sequential pattern mining by using DS-MMFI method. The results show that the method can effectively remove the volatile of time-series, and the sequence mining results are in accordance with realistic communication features.
机构地区 信息工程大学
出处 《信息工程大学学报》 2015年第2期209-213,共5页 Journal of Information Engineering University
关键词 时间序列 序列模式 DS-MMFI 序列自相关 time-series frequent sequence DS-MMFI sequence autocorrelation
  • 相关文献

参考文献6

二级参考文献21

  • 1梁晓蕾,张世栋.时态数据库中非数值型属性周期规律挖掘以及关联规则提取[J].计算机研究与发展,2007,44(z3):408-413. 被引量:1
  • 2段军,戴居丰.基于多支持度的挖掘加权关联规则算法[J].天津大学学报,2006,39(1):114-118. 被引量:14
  • 3亢海力,王来生,蔡永旺.基于概率的模糊加权关联规则挖掘[J].计算机应用,2006,26(B06):113-114. 被引量:6
  • 4Agrawal R,Imietinski T, Swami A.Mining association rules between sets of items in large database[C].Washington:Proceeding of the ACM SIGMOD International Conference on Management of Data, 1993:207-216.
  • 5Agrawal R,Srikant.Fast algorithms for mining association rules [C]. Proceeding of the 20th International Conference on Very Large Databases, 1994:487-499.
  • 6Han J, Pei J,Yin Y.Mining frequent patterns without candidate generation[C].Dallas:Proceeding of the ACM SIGMOD Intema- tional Conference on Management of Data,2000:1-12.
  • 7Bayardo R.Efficiently mining long patterns from databases[C]. New York: Proceeding of 1998 ACM SIGMOD International Conference on Management of Data,1998:85-93.
  • 8Burdick D,Calimlim M,Flannick J,et al.MAFIA:A maximal frequent itemset algorithm [J]. IEEE Transactions on Knowledge and Data Engineering,2005(11): 1490-1504.
  • 9Gouda K,Zaki MJ.Efficiently mining maximal frequent itemsets [C].Proceeding of the IEEE International Conference on Data Mining,2001:163 - 170.
  • 10Zhou QH,Wesley C,Lu BJ.SmartMiner:A depth 1st algorithm guided by tail information for mining maximal frequent itemsets [C].Proceeding of the IEEE International Conference on Data Mining,2002:570-577.

共引文献64

同被引文献32

  • 1夏冰,刘亚雷,穆晓敏,齐林,杨守义.一种改进的非线性PCA胎儿心电信号提取算法[J].郑州大学学报(理学版),2009,41(1):99-103. 被引量:3
  • 2沙金,邓成玉,张翠肖,刘伟峰.闭合序列模式挖掘算法[J].计算机工程与设计,2006,27(3):514-518. 被引量:9
  • 3Agrawl R, Sfikant R. Mining Sequential Patterns [ A]. Pro- ceedings of the 11 th International Conference on Data Engi- neering [C]. Taipei, Taiwan,1995.3 - 14.
  • 4Agrawal R, Srikant R. Mining Quantitative Association Rules in Large Relational Tables [A]. Proceedings of the ACM SIGMOD Conference on Management of Data ( SIGMOD'96 ) [ C]. Montreal. 1996.1 - 12.
  • 5Srikant R, Agrawal R. Mining sequential patterns: Generali- zations and performance improvements [ A]. The 5th Interna- tional Conference on Extending Database Technology [ C]. London, UK : Springer - Verlag, 1996.3 - 17.
  • 6Ayres J, Flannick J, Gehrke J. Sequential pattern mining u- sing a bitmap representation [J]. Knowledge Discovery and Data Mining, 2002,12(6) :429 -435.
  • 7Pei J, Han J, Mortazavi B. Prefixspan : mining sequential pat- terns efficiently by prefix -projected pattern growth [ J ]. Data Engineering, 2001, 8(4) :215 -224.
  • 8Zaki M J. SPADE:An Effieient Algorithm for Mining Frequent Sequences [ J ]. Machine Learning, 2001, 11 (5) :31 - 60.
  • 9Yan X, Han J, Afshar R. CloSpan: mining closed sequential patterns in large data base [ C]. In: SPM'03, San Franeiso, CA, 2003.
  • 10Wang J, Han J. BIDE : efficient mining of frequent closed se- quences [ C]. ICDE'04, Boston, USA. 2004. 79-90.

引证文献5

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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