Skip to search formSkip to main contentSkip to account menu

Lossy Count Algorithm

The lossy count algorithm is an algorithm to identify elements in a data stream whose frequency count exceed a user-given threshold. The frequency… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
AlgorithmClickstreamStreaming algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Mining Prominent Closed Frequent Item sets from Data Streams using Dynamic and Adaptive Minimum Support Threshold
Prominent closed frequent itemsets (CFIs) are the set of highly frequent closed itemsets whose support is considerably larger… 
2015
2015
A Lossy Counting-Based State of Charge Estimation Method and Its Application to Electric Vehicles
Estimating the residual capacity or state-of-charge (SoC) of commercial batteries on-line without destroying them or interrupting… 
2012
2012
Parallelizing the Weighted Lossy Counting Algorithm in High-speed Network Monitoring
  • Yu Zhang
  • Second International Conference on…
  • 2012
  • Corpus ID: 38601451
With the ever increasing of network traffic and link bandwidth, parallel frequent item mining becomes more and more important in… 
2011
2011
A load shedding scheme for frequent pattern mining in transactional data streams
In this paper, we study overload handling for frequent-pattern mining in online data streams. For a mining system with an e… 
2009
2009
Frequent Items Mining on Data Stream Based on Time Fading Factor
Most of the existing algorithms for mining frequent items on data stream do not emphasis the importance of the recent data items… 
2009
2009
Discovering frequent itemsets over transactional data streams through an efficient and stable approximate approach
2007
2007
State-of-the-art in data stream mining
2007
2007
TCAM-conscious Algorithms for Data Streams
There has been significant interest in developing space and time efficient solutions for answering continuous summarization… 
2007
2007
Adaptive Frequency Counting over Bursty Data Streams
We investigate the problem of frequent itemset mining over a data stream with bursty traffic. In many modern applications, data… 
2004
2004
Research on arithmetic frequent datasets over data stream
Mining frequent items over data stream is an important problem of research,which is the foundation of several other researches… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)