Mining frequent items in data stream using time fading model (Q498012): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})$ Space Lower Bound for Finding ε-Approximate Quantiles in a Data Stream / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying frequent items in a network using gossip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding repeated elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3610976 / rank
 
Normal rank

Revision as of 19:23, 10 July 2024

scientific article
Language Label Description Also known as
English
Mining frequent items in data stream using time fading model
scientific article

    Statements

    Mining frequent items in data stream using time fading model (English)
    0 references
    0 references
    0 references
    25 September 2015
    0 references
    stream data mining
    0 references
    frequent data item
    0 references
    fading factor
    0 references
    hash function
    0 references

    Identifiers