On the public citation graph

Discovery of Temporal Frequent Patterns Using TFP-Tree

0 signed · 22 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-36087-5_7openalex-snapshot
Discovering Temporal Relation Rules Mining from Interval Data
inferredcites →https://doi.org/10.1007/978-3-540-24655-8_61openalex-snapshot
Similarity Pattern Discovery Using Calendar Concept Hierarchy in Time Series Data
inferredcites →https://doi.org/10.1007/b96838openalex-snapshot
Advanced Web technologies and applications : 6th Asia-Pacific Web conference, APWeb 2004, Hangzhou, China, April 14-17, 2004 : proceedings
inferredcites →https://doi.org/10.1016/s0169-023x(02)00135-0openalex-snapshot
Discovering calendar-based temporal association rules
inferredcites →https://doi.org/10.1109/icde.1995.380415openalex-snapshot
Mining sequential patterns
inferredcites →https://doi.org/10.1109/icde.1998.655804openalex-snapshot
Cyclic association rules
inferredcites →https://doi.org/10.1109/time.2001.930706openalex-snapshot
Discovering calendar-based temporal association rules
inferredcites →https://doi.org/10.1145/253260.253327openalex-snapshot
Beyond market baskets
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

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-319-58088-3_19openalex-snapshot
A Computationally Efficient Approach for Mining Similar Temporal Patterns
inferred← citeshttps://doi.org/10.1007/978-3-319-58088-3_20openalex-snapshot
Estimating Prevalence Bounds of Temporal Association Patterns to Discover Temporally Similar Patterns
inferred← citeshttps://doi.org/10.1007/978-3-540-72909-9_6openalex-snapshot
Mining Recent Frequent Itemsets over Data Streams with a Time-Sensitive Sliding Window
inferred← citeshttps://doi.org/10.1007/s00500-016-2445-yopenalex-snapshot
A novel fuzzy gaussian-based dissimilarity measure for discovering similarity temporal association patterns
inferred← citeshttps://doi.org/10.1007/s00521-018-3776-7openalex-snapshot
VRKSHA: a novel tree structure for time-profiled temporal association mining
inferred← citeshttps://doi.org/10.1016/j.future.2017.01.013openalex-snapshot
G-SPAMINE: An approach to discover temporal association patterns and trends in internet of things
inferred← citeshttps://doi.org/10.1109/alpit.2007.39openalex-snapshot
Mining Frequent Itemsets over Data Streams with Multiple Time-Sensitive Sliding Windows
inferred← citeshttps://doi.org/10.1109/iccic.2015.7435809openalex-snapshot
A novel approach to discover similar temporal association patterns in a single database scan
inferred← citeshttps://doi.org/10.1145/2832987.2833071openalex-snapshot
A Novel Approach for Mining Similarity Profiled Temporal Association Patterns Using Venn Diagrams
inferred← citeshttps://doi.org/10.11606/d.3.2011.tde-26112010-105735openalex-snapshot
Previsão de localização futura de veículos baseada em dados de AVL.
inferred← citeshttps://doi.org/10.30574/ijsra.2024.12.2.1366openalex-snapshot
Discovering temporal frequent patterns: An optimized approach
inferred← citeshttps://doi.org/10.48550/arxiv.1604.05272openalex-snapshot
A Novel Approach for Mining Similarity Profiled Temporal Association Patterns
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.