Mining frequent items in data stream using time fading model

DOI10.1016/j.ins.2013.09.007zbMath1320.68133OpenAlexW1998626394MaRDI QIDQ498012

Qingling Mei, Ling Chen

Publication date: 25 September 2015

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2013.09.007

zbMATH Keywords

hash functionstream data miningfading factorfrequent data item

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (6)

Top-\(k\) frequent items and item frequency tracking over sliding windows of any size ⋮ Fast and accurate mining of correlated heavy hitters ⋮ Ordered subtree mining via transactional mapping using a structure-preserving tree database schema ⋮ Recursive estimation of high-order Markov chains: approximation by finite mixtures ⋮ Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions ⋮ Distributed mining of time-faded heavy hitters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models
• Identifying frequent items in a network using gossip
• Finding repeated elements
• An $\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})$ Space Lower Bound for Finding ε-Approximate Quantiles in a Data Stream
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window

This page was built for publication: Mining frequent items in data stream using time fading model