On the public citation graph

Quick Inclusion-Exclusion

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/3-540-45372-5_8openalex-snapshot
Approximation of Frequency Queries by Means of Free-Sets
inferredcites →https://doi.org/10.1007/3-540-45465-9_6openalex-snapshot
Local and Global Methods in Data Mining: Basic Techniques and Open Problems
inferredcites →https://doi.org/10.1007/3-540-45681-3_18openalex-snapshot
Support Approximations Using Bonferroni-Type Inequalities
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-48050-1_42openalex-snapshot
Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns?
inferredcites →https://doi.org/10.1007/978-3-540-39804-2_9openalex-snapshot
Minimal k-Free Representations of Frequent Sets
inferredcites →https://doi.org/10.1007/978-3-642-57489-4_59openalex-snapshot
Induction of Association Rules: Apriori Implementation
inferredcites →https://doi.org/10.1007/978-3-642-58951-5_2openalex-snapshot
Fundamental Algorithms
inferredcites →https://doi.org/10.1023/a:1009713703947openalex-snapshot
Beyond Market Baskets: Generalizing Association Rules to Dependence Rules
inferredcites →https://doi.org/10.1109/tkde.2003.1245281openalex-snapshot
Beyond independence: probabilistic models for query approximation on binary transaction data
inferredcites →https://doi.org/10.1145/363951.363956openalex-snapshot
Theory of dependence values
inferredcites →https://doi.org/10.1145/375551.375604openalex-snapshot
A condensed representation to find frequent patterns
inferredcites →https://doi.org/10.1145/502512.502572openalex-snapshot
Real world performance of association rule algorithms
inferredcites →https://doi.org/10.1145/967900.968011openalex-snapshot
Mining dependence rules by finding largest itemset support quota
inferredcites →https://doi.org/10.1613/jair.453openalex-snapshot
Cached Sufficient Statistics for Efficient Machine Learning with Large Datasets

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11871637_61openalex-snapshot
Closed Non-derivable Itemsets
inferred← citeshttps://doi.org/10.1007/11893318_18openalex-snapshot
Itemset Support Queries Using Frequent Itemsets and Their Condensed Representations
inferred← citeshttps://doi.org/10.1007/978-3-642-15105-7_11openalex-snapshot
Mining Non-redundant Information-Theoretic Dependencies between Itemsets
inferred← citeshttps://doi.org/10.1007/s10618-006-0054-6openalex-snapshot
Non-derivable itemset mining
inferred← citeshttps://doi.org/10.1007/s10618-015-0409-yopenalex-snapshot
Sampling frequent and minimal boolean patterns: theory and application in classification
inferred← citeshttps://doi.org/10.1016/j.datak.2009.01.002openalex-snapshot
Mining non-derivable frequent itemsets over data stream
inferred← citeshttps://doi.org/10.1137/1.9781611972795.87openalex-snapshot
Efficient Computation of Partial-Support for Mining Interesting Itemsets
inferred← citeshttps://doi.org/10.1145/1557019.1557097openalex-snapshot
Towards efficient mining of proportional fault-tolerant frequent itemsets
inferred← citeshttps://doi.org/10.1145/2382577.2382580openalex-snapshot
Summarizing data succinctly with the most informative itemsets
inferred← citeshttps://doi.org/10.32657/10356/45201openalex-snapshot
Mining interesting itemsets
inferred← citeshttps://doi.org/10.4018/jkdb.2010070105openalex-snapshot
Mining Frequent Boolean Expressions
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.