On the public citation graph
SPEED : Mining Maxirnal Sequential Patterns over Data Strearns
0 signed · 26 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.1007/bf00264437openalex-snapshot
A longest common subsequence algorithm suitable for similar text strings
inferredcites →https://doi.org/10.1007/bfb0014140openalex-snapshot
Mining sequential patterns: Generalizations and performance improvements
inferredcites →https://doi.org/10.1016/b978-012722442-8/50017-3openalex-snapshot
A Regression-Based Temporal Pattern Mining Scheme for Data Streams
inferredcites →https://doi.org/10.1016/b978-155860869-6/50038-xopenalex-snapshot
Approximate Frequency Counts over Data Streams
inferredcites →https://doi.org/10.1109/icdm.2004.10084openalex-snapshot
Moment: Maintaining Closed Frequent Itemsets over a Stream Sliding Window
inferredcites →https://doi.org/10.1145/170035.170072openalex-snapshot
Mining association rules between sets of items in large databases
inferredcites →https://doi.org/10.1145/584792.584799openalex-snapshot
Mining sequential patterns with constraints in large databases
inferredcites →https://doi.org/10.1145/584796.584799openalex-snapshot
Mining sequential patterns with constraints in large databases
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/978-3-031-35510-3_22openalex-snapshot
Leveraging Sequence Mining for Robot Process Automation
inferred← citeshttps://doi.org/10.1007/978-3-319-00372-6_7openalex-snapshot
Pattern Extraction from Graphs and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-85836-2_25openalex-snapshot
Mining Multidimensional Sequential Patterns over Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-642-04747-3_27openalex-snapshot
Mining Local Correlation Patterns in Sets of Sequences
inferred← citeshttps://doi.org/10.1007/s00778-008-0100-7openalex-snapshot
Efficient frequent sequence mining by a dynamic strategy switching algorithm
inferred← citeshttps://doi.org/10.1007/s10489-021-02536-7openalex-snapshot
New approaches for mining regular high utility sequential patterns
inferred← citeshttps://doi.org/10.1007/s10994-016-5617-1openalex-snapshot
Memory-adaptive high utility sequential pattern mining over data streams
inferred← citeshttps://doi.org/10.1007/s41060-024-00659-xopenalex-snapshot
Sequential pattern mining algorithms and their applications: a technical review
inferred← citeshttps://doi.org/10.1016/j.knosys.2013.10.011openalex-snapshot
Mining maximal frequent patterns by considering weight conditions over data streams
inferred← citeshttps://doi.org/10.1109/icmse.2009.5317911openalex-snapshot
Predicting trend in futures prices time series using a new association rules algorithm
inferred← citeshttps://doi.org/10.3934/aci.2023004openalex-snapshot
From basic approaches to novel challenges and applications in Sequential Pattern Mining
inferred← citeshttps://doi.org/10.4018/jdwm.2011100101openalex-snapshot
Incremental Algorithm for Discovering Frequent Subsequences in Multiple Data Streams
inferred← citeshttps://doi.org/10.70675/0f07e7e4za923z44d3za713za361ae9ec172openalex-snapshot
Résumé de Flots de Données : motifs, Cubes et Hiérarchies
inferred← citeshttps://doi.org/10.70675/4fb85f31za938z49f8za956z6c7b002ab6b5openalex-snapshot
Extraction de motifs fréquents sous contraintes
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.