On the public citation graph

A Further Study on Inverse Frequent Set Mining

0 signed · 13 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.1145/1055558.1055580openalex-snapshot
Computational complexity of itemset frequency satisfiability
inferredcites →https://doi.org/10.1145/377978.377983openalex-snapshot
Probabilistic logic programming with conditional constraints
inferredcites →https://doi.org/10.1145/773153.773181openalex-snapshot
Feasible itemset distributions in data mining

What points at this work

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

inferred← citeshttps://doi.org/10.1002/widm.1082openalex-snapshot
Association rule hiding methods
inferred← citeshttps://doi.org/10.1007/11788911_13openalex-snapshot
A FP-Tree-Based Method for Inverse Frequent Set Mining
inferred← citeshttps://doi.org/10.1007/978-3-319-77965-2_1openalex-snapshot
The Conflict Between Big Data and Individual Privacy
inferred← citeshttps://doi.org/10.1007/s00236-007-0060-1openalex-snapshot
The complexity of satisfying constraints on databases of transactions
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.11.003openalex-snapshot
Itemset frequency satisfiability: Complexity and axiomatization
inferred← citeshttps://doi.org/10.1109/access.2014.2362522openalex-snapshot
Information Security in Big Data: Privacy and Data Mining
inferred← citeshttps://doi.org/10.1145/2541268.2541271openalex-snapshot
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs
inferred← citeshttps://doi.org/10.1360/jos182782openalex-snapshot
Knowledge Hiding in Database
inferred← citeshttps://doi.org/10.14778/1687627.1687758openalex-snapshot
An audit environment for outsourcing of frequent itemset mining
inferred← citeshttps://doi.org/10.21090/ijaerd.c1087305openalex-snapshot
A SURVEY ON ASSOCIATION RULE HIDING APPROACHES
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.