On the public citation graph
An Efficient Algorithm for Frequent Itemset Mining on Data Streams
0 signed · 34 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/b978-155860869-6/50038-xopenalex-snapshot
Approximate Frequency Counts over Data Streams
inferredcites →https://doi.org/10.1016/s0898-1221(96)90007-3openalex-snapshot
Advances in knowledge discovery and data mining
inferredcites →https://doi.org/10.1109/icdm.2005.21openalex-snapshot
An Algorithm for In-Core Frequent Itemset Mining on Streaming Data
inferredcites →https://doi.org/10.1137/1.9781611972726.27openalex-snapshot
CHARM: An Efficient Algorithm for Closed Itemset Mining
inferredcites →https://doi.org/10.1145/1014052.1014079openalex-snapshot
Incremental maintenance of quotient cube for median
inferredcites →https://doi.org/10.1145/335191.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1145/342009.335372openalex-snapshot
Mining frequent patterns without candidate generation
inferredcites →https://doi.org/10.1145/375663.375665openalex-snapshot
On computing correlated aggregates over continual data streams
inferredcites →https://doi.org/10.1145/378580.378687openalex-snapshot
Estimating simple functions on the union of data streams
inferredcites →https://doi.org/10.1145/543613.543615openalex-snapshot
Models and issues in data stream systems
inferredcites →https://doi.org/10.1145/564691.564699openalex-snapshot
Processing complex aggregate queries over data streams
inferredcites →https://doi.org/10.14778/2367502.2367508openalex-snapshot
Approximate frequency counts over data streams
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11811305_118openalex-snapshot
MFIS—Mining Frequent Itemsets on Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-319-16313-0_2openalex-snapshot
Discovering Chronic-Frequent Patterns in Transactional Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-76719-0_47openalex-snapshot
MMFI_DSSW – A New Method to Incrementally Mine Maximal Frequent Itemsets in Transaction Sensitive Sliding Window
inferred← citeshttps://doi.org/10.1007/978-3-540-88906-9_25openalex-snapshot
RP-Tree: A Tree Structure to Discover Regular Patterns in Transactional Database
inferred← citeshttps://doi.org/10.1007/978-3-642-01307-2_24openalex-snapshot
Discovering Periodic-Frequent Patterns in Transactional Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-12026-8_31openalex-snapshot
Mining Regular Patterns in Data Streams
inferred← citeshttps://doi.org/10.1007/s10489-018-1280-5openalex-snapshot
SPPC: a new tree structure for mining erasable patterns in data streams
inferred← citeshttps://doi.org/10.1007/s13369-015-1811-xopenalex-snapshot
FPS-Tree Algorithm to Find Top-k Closed Itemsets in Data Streams
inferred← citeshttps://doi.org/10.1016/j.future.2016.04.008openalex-snapshot
Scalable regular pattern mining in evolving body sensor data
inferred← citeshttps://doi.org/10.1016/j.ins.2009.07.012openalex-snapshot
Sliding window-based frequent pattern mining over data streams
inferred← citeshttps://doi.org/10.1016/j.ins.2016.06.018openalex-snapshot
Real-time stream data mining based on CanTree and Gtree
inferred← citeshttps://doi.org/10.1016/j.jss.2011.09.055openalex-snapshot
A dynamic layout of sliding window for frequent itemset mining over data streams
inferred← citeshttps://doi.org/10.1016/j.jss.2012.10.011openalex-snapshot
A sliding window based algorithm for frequent closed itemset mining over data streams
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.11.2568openalex-snapshot
Mining Regular Patterns in Transactional Databases
inferred← citeshttps://doi.org/10.1109/access.2021.3070132openalex-snapshot
A Sliding Window-Based Approach for Mining Frequent Weighted Patterns Over Data Streams
inferred← citeshttps://doi.org/10.1109/cci.2016.7778948openalex-snapshot
Identify individuals behaviors based GPS trajectories in the Internet of Things
inferred← citeshttps://doi.org/10.1109/iccke.2011.6413359openalex-snapshot
A new sliding window based algorithm for frequent closed itemset mining over data streams
inferred← citeshttps://doi.org/10.3233/ida-2011-0483openalex-snapshot
EclatDS: An efficient sliding window based frequent pattern mining method for data streams
inferred← citeshttps://doi.org/10.47164/ijngc.v13i3.806openalex-snapshot
Enhancing the Performance of Association Rule Generation over Dynamic Data using Incremental Tree Structures
inferred← citeshttps://doi.org/10.5120/17662-8479openalex-snapshot
Continuous Prediction of Closed Frequent Itemsets from High speed Distributed Data Streams using Parallel Mining on Manifold Windows with Varying Size
inferred← citeshttps://doi.org/10.6688/jise.2013.29.5.12openalex-snapshot
An Efficient Sliding Window Based Algorithm for Adaptive Frequent Itemset Mining over Data Streams
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.