On the public citation graph
Closed Non-derivable Itemsets
0 signed · 29 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/3-540-44794-6openalex-snapshot
Principles of Data Mining and Knowledge Discovery
inferredcites →https://doi.org/10.1007/3-540-45681-3_7openalex-snapshot
Mining All Non-derivable Frequent Itemsets
inferredcites →https://doi.org/10.1007/3-540-49257-7_1openalex-snapshot
Issues Raised by Three Years of Developing PJama: An Orthogonally Persistent Platform for Java™
inferredcites →https://doi.org/10.1007/3-540-49257-7_25openalex-snapshot
Discovering Frequent Closed Itemsets for Association Rules
inferredcites →https://doi.org/10.1007/b106731openalex-snapshot
Knowledge Discovery in Inductive Databases
inferredcites →https://doi.org/10.1145/170035.170072openalex-snapshot
Mining association rules between sets of items in large databases
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-13212-9_3openalex-snapshot
Synthesizing Arbitrary Boolean Expressions Induced by Frequent Itemsets
inferred← citeshttps://doi.org/10.1007/978-3-540-74976-9_44openalex-snapshot
MINI: Mining Informative Non-redundant Itemsets
inferred← citeshttps://doi.org/10.1007/978-3-540-87479-9_24openalex-snapshot
Minimum-Size Bases of Association Rules
inferred← citeshttps://doi.org/10.1007/978-3-642-02319-4_13openalex-snapshot
Closures of Downward Closed Representations of Frequent Patterns
inferred← citeshttps://doi.org/10.1007/978-3-642-03348-3_9openalex-snapshot
Closed Non Derivable Data Cubes Based on Non Derivable Minimal Generators
inferred← citeshttps://doi.org/10.1007/978-3-642-03730-6_12openalex-snapshot
Non-Derivable Item Set and Non-Derivable Literal Set Representations of Patterns Admitting Negation
inferred← citeshttps://doi.org/10.1007/978-3-642-25838-1_2openalex-snapshot
A New Concise and Exact Representation of Data Cubes
inferred← citeshttps://doi.org/10.1007/978-3-642-35527-1_63openalex-snapshot
Constrained Closed Non Derivable Data Cubes
inferred← citeshttps://doi.org/10.1007/978-3-658-33813-8_12openalex-snapshot
Identifikation relevanter Zusammenhänge in Daten mit maschinellem Lernen
inferred← citeshttps://doi.org/10.1007/978-981-15-9509-7_41openalex-snapshot
Study of Effective Mining Algorithms for Frequent Itemsets
inferred← citeshttps://doi.org/10.1007/s10115-010-0329-5openalex-snapshot
Efficient mining of all margin-closed itemsets with applications in temporal knowledge discovery and classification by compression
inferred← citeshttps://doi.org/10.1016/j.datak.2009.05.001openalex-snapshot
Sweeping the disjunctive search space towards mining new exact concise representations of frequent itemsets
inferred← citeshttps://doi.org/10.1016/j.datak.2011.02.003openalex-snapshot
Reliable representations for association rules
inferred← citeshttps://doi.org/10.1109/iciccs48265.2020.9121071openalex-snapshot
A List based Redundancy Removal Approach by Mining Closed and Non-Derivable Frequent Itemsets
inferred← citeshttps://doi.org/10.1142/s0218213014500018openalex-snapshot
Towards Faster Mining of Disjunction-Based Concise Representations of Frequent Patterns
inferred← citeshttps://doi.org/10.1145/1835804.1835840openalex-snapshot
Frequent regular itemset mining
inferred← citeshttps://doi.org/10.2168/lmcs-6(2:4)2010openalex-snapshot
Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules
inferred← citeshttps://doi.org/10.3233/ida-2009-0384openalex-snapshot
A new generic basis of “factual” and “implicative” association rules1
inferred← citeshttps://doi.org/10.4018/ijkbo.2013040104openalex-snapshot
A Framework for Synthesizing Arbitrary Boolean Queries Induced by Frequent Itemsets
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.