On the public citation graph

Efficient discovery of interesting patterns based on strong closedness

https://doi.org/10.1002/sam.10057
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.
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/978-3-540-30214-8_2openalex-snapshot
An Efficient Algorithm for Enumerating Closed Patterns in Transaction Databases
inferredcites →https://doi.org/10.1007/978-3-540-32262-7_15openalex-snapshot
A Generic Algorithm for Generating Closed Sets of a Binary Relation
inferredcites →https://doi.org/10.1007/978-3-642-59830-2openalex-snapshot
Formal Concept Analysis
inferredcites →https://doi.org/10.1007/bf00383449openalex-snapshot
Finding all closed sets: A general approach
inferredcites →https://doi.org/10.1016/s0169-023x(02)00057-5openalex-snapshot
Computing iceberg concept lattices with Titanic
inferredcites →https://doi.org/10.1016/s0306-4379(99)00003-4openalex-snapshot
Efficient mining of association rules using closed itemset lattices
inferredcites →https://doi.org/10.1016/s1389-1286(99)00040-7openalex-snapshot
Trawling the Web for emerging cyber-communities
inferredcites →https://doi.org/10.1023/a:1009796218281openalex-snapshot
Levelwise Search and Borders of Theories in Knowledge Discovery
inferredcites →https://doi.org/10.1023/a:1021571501451openalex-snapshot
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
inferredcites →https://doi.org/10.1109/icdm.2006.1openalex-snapshot
\delta-Tolerance Closed Frequent Itemsets
inferredcites →https://doi.org/10.1137/1.9781611972726.27openalex-snapshot
CHARM: An Efficient Algorithm for Closed Itemset Mining
inferredcites →https://doi.org/10.1145/1007730.1007744openalex-snapshot
Advances in frequent itemset mining implementations
inferredcites →https://doi.org/10.1145/312129.312241openalex-snapshot
Using association rules for product assortment decisions
inferredcites →https://doi.org/10.1145/502512.502539openalex-snapshot
Efficient discovery of error-tolerant frequent itemsets in high dimensions
inferredcites →https://doi.org/10.3233/ida-2005-9105openalex-snapshot
Constraint-based concept mining and its application to microarray data analysis

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-67786-6_18openalex-snapshot
Mining Strongly Closed Itemsets from Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-319-75193-1_2openalex-snapshot
Mining Generalized Closed Patterns from Multi-graph Collections
inferred← citeshttps://doi.org/10.1007/s10618-016-0467-9openalex-snapshot
Skopus: Mining top-k sequential patterns under leverage
inferred← citeshttps://doi.org/10.1007/s10994-019-05827-wopenalex-snapshot
Effective approximation of parametrized closure systems over transactional data streams
inferred← citeshttps://doi.org/10.1016/j.neuroimage.2013.12.024openalex-snapshot
A novel meta-analytic approach: Mining frequent co-activation patterns in neuroimaging databases
inferred← citeshttps://doi.org/10.1109/bigdata55660.2022.10020826openalex-snapshot
A Fast On-Line ϵ-Approximation Algorithm for Mining Strongly Closed Itemsets
inferred← citeshttps://doi.org/10.1109/cbms.2012.6266302openalex-snapshot
PaMiNI: A comprehensive system for mining frequent neuronal patterns of the human brain
inferred← citeshttps://doi.org/10.1109/fskd.2009.670openalex-snapshot
JPMiner: Mining Frequent Jump Patterns from Graph Databases
inferred← citeshttps://doi.org/10.1109/icdm.2013.124openalex-snapshot
Mining Statistically Significant Sequential Patterns
inferred← citeshttps://doi.org/10.1109/icdm.2019.00169openalex-snapshot
Permutation Strategies for Mining Significant Sequential Patterns
inferred← citeshttps://doi.org/10.1109/iiai-aai53430.2021.00088openalex-snapshot
A Preliminary Study of Closed Generalized Itemsets and Their Enumeration Algorithms
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.