Mining frequent items in data stream using time fading model

DOI10.1016/J.INS.2013.09.007zbMATH Open1320.68133OpenAlexW1998626394MaRDI QIDQ498012FDOQ498012

Authors: 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

Recommendations

• An efficient algorithm for mining approximate frequent item over data streams
• Mining approximate frequent itemsets over data streams using window sliding techniques
• Mining recent frequent itemsets in sliding windows over data streams
• scientific article; zbMATH DE number 2086663
• Finding frequent items in data streams

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)

Cites Work

• Finding repeated elements
• Title not available (Why is that?)
• Identifying frequent items in a network using gossip
• An \(\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})\) space lower bound for finding \(\epsilon \)-approximate quantiles in a data stream
• A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
• An efficient algorithm for mining approximate frequent item over data streams
• Title not available (Why is that?)
• \(P\)-top-\(k\) queries in a probabilistic framework from information extraction models

Cited In (15)

• An efficient algorithm for mining approximate frequent item over data streams
• 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
• RFIMiner: A regression-based algorithm for recently frequent patterns in multiple time granularity data streams
• Mining approximate frequent itemsets over data streams using window sliding techniques
• Efficiently answering top-k frequent term queries in temporal-categorical range
• Distributed mining of time-faded heavy hitters
• Title not available (Why is that?)
• Mining recent frequent itemsets in sliding windows over data streams
• Study on discovering frequent items algorithm for distributed data stream
• Fractal-based algorithms for burst detection over data streams
• The frequent items problem, under polynomial decay, in the streaming model
• Top-\(k\) frequent items and item frequency tracking over sliding windows of any size

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498012)