Optimal k-Anonymity with Flexible Generalization Schemes through Bottom-up Searching

Get BibTex-formatted data

Author

Tiancheng Li, Ninghui Li

Entry type

conference

Abstract

In recent years, a major thread of research on kanonymity has focused on developing more flexible generalization schemes that produce higher-quality datasets. In this paper we introduce three new generalization schemes that improve on existing schemes, as well as algorithms enumerating valid generalizations in these schemes. We also introduce a taxonomy for generalization schemes and a new cost metric for measuring information loss. We present a bottom-up search strategy for finding optimal anonymizations. This strategy works particularly well when the value of k is small. We show the feasibility of our approach through experiments on real census data.

Date

2006 – 1 – 1

URL

http://csdl2.computer.org/pers ... I;=10.1109/ICDMW.2006.127

Booktitle

Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)

Key alpha

Pages

518-523

Publication Date

2006-01-01

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Conference{ Li,
	title = "Optimal k-Anonymity with Flexible Generalization Schemes through Bottom-up Searching",
	author = "Tiancheng Li, Ninghui Li",
	year = "2006",
	month = "1",
	booktitle = "Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)",
	pages = "518-523",
	day = "1",
	abstract = "In recent years, a major thread of research on kanonymity has focused on developing more flexible generalization schemes that produce higher-quality datasets. In this paper we introduce three new generalization schemes that improve on existing schemes, as well as algorithms enumerating valid generalizations in these schemes. We also introduce a taxonomy for generalization schemes and a new cost metric for measuring information loss. We present a bottom-up search strategy for finding optimal anonymizations. This strategy works particularly well when the value of k is small. We show the feasibility of our approach through experiments on real census data.",
	url = "http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc;=comp/proceedings/icdmw/2006/2702/00/2702toc.xml&DOI;=10.1109/ICDMW.2006.127",
}