在不断发展的仅追加和动态事务数据流中挖掘有限空间的频率变化模式的单遍算法

Hua-Fu Li, Suh-Yin Lee
{"title":"在不断发展的仅追加和动态事务数据流中挖掘有限空间的频率变化模式的单遍算法","authors":"Hua-Fu Li, Suh-Yin Lee","doi":"10.1109/EEE.2004.1287312","DOIUrl":null,"url":null,"abstract":"We propose an online single-pass algorithm MFC-append (mining frequency change patterns in append-only data streams) for online mining frequent frequency change items in continuous append-only data streams. An online space-efficient data structure called Change-Sketch is developed for providing fast response time to compute dynamic frequency changes between data streams. A modified approach MFC-dynamic (mining frequency change patterns in dynamic data streams) is also presented to mine frequency changes in dynamic data streams. The theoretic analyses show that our algorithms meet the major performance requirements of single-pass, bounded storage, and real time for streaming data mining.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Single-pass algorithms for mining frequency change patterns with limited space in evolving append-only and dynamic transaction data streams\",\"authors\":\"Hua-Fu Li, Suh-Yin Lee\",\"doi\":\"10.1109/EEE.2004.1287312\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose an online single-pass algorithm MFC-append (mining frequency change patterns in append-only data streams) for online mining frequent frequency change items in continuous append-only data streams. An online space-efficient data structure called Change-Sketch is developed for providing fast response time to compute dynamic frequency changes between data streams. A modified approach MFC-dynamic (mining frequency change patterns in dynamic data streams) is also presented to mine frequency changes in dynamic data streams. The theoretic analyses show that our algorithms meet the major performance requirements of single-pass, bounded storage, and real time for streaming data mining.\",\"PeriodicalId\":360167,\"journal\":{\"name\":\"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EEE.2004.1287312\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EEE.2004.1287312","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

我们提出了一种在线单遍算法MFC-append(挖掘仅追加数据流中的频率变化模式),用于在线挖掘连续仅追加数据流中的频繁频率变化项。为了提供快速的响应时间来计算数据流之间的动态频率变化,开发了一种称为Change-Sketch的在线空间高效数据结构。提出了一种改进的MFC-dynamic(挖掘动态数据流中的频率变化模式)方法来挖掘动态数据流中的频率变化。理论分析表明,我们的算法满足了流数据挖掘的单遍、有界存储和实时性的主要性能要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Single-pass algorithms for mining frequency change patterns with limited space in evolving append-only and dynamic transaction data streams
We propose an online single-pass algorithm MFC-append (mining frequency change patterns in append-only data streams) for online mining frequent frequency change items in continuous append-only data streams. An online space-efficient data structure called Change-Sketch is developed for providing fast response time to compute dynamic frequency changes between data streams. A modified approach MFC-dynamic (mining frequency change patterns in dynamic data streams) is also presented to mine frequency changes in dynamic data streams. The theoretic analyses show that our algorithms meet the major performance requirements of single-pass, bounded storage, and real time for streaming data mining.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信