On the public citation graph

Approximation Bounds for Minimum Information Loss Microaggregation

https://doi.org/10.1109/tkde.2009.78

0 signed · 32 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-1-4613-0121-9openalex-snapshot

Elements of Statistical Disclosure Control

inferredcites →https://doi.org/10.1007/s00778-006-0007-0openalex-snapshot

Efficient multivariate data-oriented microaggregation

inferredcites →https://doi.org/10.1007/s10618-005-0007-5openalex-snapshot

Ordinal, Continuous and Heterogeneous k-Anonymity Through Microaggregation

inferredcites →https://doi.org/10.1016/0167-6377(93)90097-zopenalex-snapshot

A greedy heuristic for a minimum-weight forest problem

inferredcites →https://doi.org/10.1016/0167-6377(94)90067-1openalex-snapshot

Approximating minimum-cost graph problems with spanning tree edges

inferredcites →https://doi.org/10.1016/j.camwa.2007.04.034openalex-snapshot

A polynomial-time approximation to optimal multivariate microaggregation

inferredcites →https://doi.org/10.1016/j.comgeo.2008.06.006openalex-snapshot

The projection median of a set of points

inferredcites →https://doi.org/10.1016/j.dam.2005.06.006openalex-snapshot

A class of heuristics for the constrained forest problem

inferredcites →https://doi.org/10.1016/j.orl.2004.11.010openalex-snapshot

Another greedy heuristic for the constrained forest problem

inferredcites →https://doi.org/10.1073/pnas.94.24.12734openalex-snapshot

Approximation algorithms

inferredcites →https://doi.org/10.1109/64.539013openalex-snapshot

Data mining and knowledge discovery: making sense out of data

inferredcites →https://doi.org/10.1109/69.971193openalex-snapshot

Protecting respondents identities in microdata release

inferredcites →https://doi.org/10.1109/69.979982openalex-snapshot

Practical data-oriented microaggregation for statistical disclosure control

inferredcites →https://doi.org/10.1109/tkde.2003.1209020openalex-snapshot

A polynomial algorithm for optimal univariate microaggregation

inferredcites →https://doi.org/10.1109/tkde.2005.112openalex-snapshot

Minimum spanning tree partitioning algorithm for microaggregation

inferredcites →https://doi.org/10.1109/tkde.2006.136openalex-snapshot

A Tree-Based Data Perturbation Approach for Privacy-Preserving Data Mining

inferredcites →https://doi.org/10.1137/s0097539793242618openalex-snapshot

A General Approximation Technique for Constrained Forest Problems

inferredcites →https://doi.org/10.1142/s0218488502001648openalex-snapshot

k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY

inferredcites →https://doi.org/10.1145/1041680.1041683openalex-snapshot

Local ratio

inferredcites →https://doi.org/10.1145/76894.76895openalex-snapshot

Security-control methods for statistical databases: a comparative study

inferredcites →https://doi.org/10.3233/sju-2001-18409openalex-snapshot

On the complexity of optimal microaggregation for statistical disclosure control

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118348239.refsopenalex-snapshot

References

inferred← citeshttps://doi.org/10.1007/978-3-319-08470-1_2openalex-snapshot

Database Privacy

inferred← citeshttps://doi.org/10.1007/978-3-642-41550-0_5openalex-snapshot

Facility Location and Social Choice via Microaggregation

inferred← citeshttps://doi.org/10.1016/j.inffus.2014.10.003openalex-snapshot

Preference-based anonymization of numerical datasets by multi-objective microaggregation

inferred← citeshttps://doi.org/10.1016/j.ins.2019.05.011openalex-snapshot

Solving bin-packing problems under privacy preservation: Possibilities and trade-offs

inferred← citeshttps://doi.org/10.1016/j.jss.2012.10.901openalex-snapshot

Optimal univariate microaggregation with data suppression

inferred← citeshttps://doi.org/10.1016/j.jss.2014.10.012openalex-snapshot

Iterated local search for microaggregation

inferred← citeshttps://doi.org/10.1109/dsaa.2014.7058126openalex-snapshot

Sharing sensitive medical data sets for research purposes - A case study

inferred← citeshttps://doi.org/10.1109/tdsc.2009.47openalex-snapshot

CASTLE: Continuously Anonymizing Data Streams

inferred← citeshttps://doi.org/10.1109/tkde.2011.242openalex-snapshot

Successive Group Selection for Microaggregation

inferred← citeshttps://doi.org/10.1145/3588765openalex-snapshot

Survey on Privacy-Preserving Techniques for Microdata Publication

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.