在滑动窗口上查找频繁项目的实时算法

2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS) Pub Date : 2016-08-01 DOI:10.1109/ICSESS.2016.7883025

Jing Li, Jun Liu, Wenli Zhou

{"title":"在滑动窗口上查找频繁项目的实时算法","authors":"Jing Li, Jun Liu, Wenli Zhou","doi":"10.1109/ICSESS.2016.7883025","DOIUrl":null,"url":null,"abstract":"The Paper presents an improved algorithm for finding frequent elements over a sliding window. It makes no assumption on the distribution of the input items' frequency. Its main structure composes of only a few maps and short queues. By using hash table and other data structure to manage counters, the running time is dramatically decreased. After thorough experiment and logical analysis, the running time has reduced to constant.","PeriodicalId":175933,"journal":{"name":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A real-time algorithm for finding frequent items over sliding window\",\"authors\":\"Jing Li, Jun Liu, Wenli Zhou\",\"doi\":\"10.1109/ICSESS.2016.7883025\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Paper presents an improved algorithm for finding frequent elements over a sliding window. It makes no assumption on the distribution of the input items' frequency. Its main structure composes of only a few maps and short queues. By using hash table and other data structure to manage counters, the running time is dramatically decreased. After thorough experiment and logical analysis, the running time has reduced to constant.\",\"PeriodicalId\":175933,\"journal\":{\"name\":\"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSESS.2016.7883025\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSESS.2016.7883025","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文提出了一种寻找滑动窗口上频繁元素的改进算法。它不假设输入项目的频率分布。它的主要结构仅由几个地图和短队列组成。通过使用哈希表和其他数据结构来管理计数器，大大减少了运行时间。经过充分的实验和逻辑分析，运行时间降至常数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A real-time algorithm for finding frequent items over sliding window

The Paper presents an improved algorithm for finding frequent elements over a sliding window. It makes no assumption on the distribution of the input items' frequency. Its main structure composes of only a few maps and short queues. By using hash table and other data structure to manage counters, the running time is dramatically decreased. After thorough experiment and logical analysis, the running time has reduced to constant.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 7th IEEE International Conference on Software Engineering and Service Science (ICSESS)

自引率

0.00%

发文量