A single pass algorithm of finding frequent vibrated items over online data streams

Guanling Lee, Q. Chen
{"title":"A single pass algorithm of finding frequent vibrated items over online data streams","authors":"Guanling Lee, Q. Chen","doi":"10.1109/ICDIM.2007.4444224","DOIUrl":null,"url":null,"abstract":"Data streams are data items generated unbounded and continuously. To detect the vibration of data item s quantity, a single pass algorithm is proposed for mining vibrated items over online data streams in this paper. The change of data item can be reported at once by measuring its vibrated slope. Not only the change of data item will be detected, the period in which the data item is frequent vibrated is also reported. Moreover, a set of simulations is performed to show the benefit of our approach.","PeriodicalId":198626,"journal":{"name":"2007 2nd International Conference on Digital Information Management","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd International Conference on Digital Information Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDIM.2007.4444224","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Data streams are data items generated unbounded and continuously. To detect the vibration of data item s quantity, a single pass algorithm is proposed for mining vibrated items over online data streams in this paper. The change of data item can be reported at once by measuring its vibrated slope. Not only the change of data item will be detected, the period in which the data item is frequent vibrated is also reported. Moreover, a set of simulations is performed to show the benefit of our approach.
在在线数据流中查找频繁振动项的单遍算法
数据流是无界连续生成的数据项。为了检测数据项数量的振动,本文提出了一种单遍挖掘在线数据流中振动项的算法。通过测量其振动斜率,可以立即报告数据项的变化。不仅可以检测数据项的变化,还可以报告数据项频繁振动的周期。此外,还进行了一组仿真,以显示我们的方法的优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信