A Max-Min Approach for Hiding Frequent Itemsets

I
ICDMW
2006
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)
Abstract - A Max-Min Approach for Hiding Frequent Itemsets

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by George V. Moustakides Articles by Vassilios S. Verykios

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

Hong Kong, China

December 18-December 22

ISBN: 0-7695-2702-7

	ASCII Text	x
	George V. Moustakides, Vassilios S. Verykios, "A Max-Min Approach for Hiding Frequent Itemsets," Data Mining Workshops, International Conference on, pp. 502-506, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 2006.

	BibTex	x
	@article{ 10.1109/ICDMW.2006.8, author = {George V. Moustakides and Vassilios S. Verykios}, title = {A Max-Min Approach for Hiding Frequent Itemsets}, journal ={Data Mining Workshops, International Conference on}, volume = {0}, year = {2006}, isbn = {0-7695-2702-7}, pages = {502-506}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDMW.2006.8}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Data Mining Workshops, International Conference on TI - A Max-Min Approach for Hiding Frequent Itemsets SN - 0-7695-2702-7 SP502 EP506 A1 - George V. Moustakides, A1 - Vassilios S. Verykios, PY - 2006 KW - null VL - 0 JA - Data Mining Workshops, International Conference on ER -

George V. Moustakides, University of Thessaly, Volos, GREECE

Vassilios S. Verykios, University of Thessaly, Volos, GREECE

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDMW.2006.8

In this paper we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) relies on the maxmin criterion which is a method in decision theory for maximizing the minimum gain and (b) builds upon the border theory of frequent itemsets.

Citation:

George V. Moustakides, Vassilios S. Verykios, "A Max-Min Approach for Hiding Frequent Itemsets," icdmw, pp.502-506, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06), 2006

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.