[Retracted] Anonymization of Quasi-Sensitive Attribute Sets in Aggregated Dataset

Algorithm 2

The Efficient QS k-anonymity Algorithm.

	Input:,
	Output: a set of clusters in each of which the size of Cartesian product of attributes in and is greater than or equal to
(1)
(2)	ifthen
(3)	return
(4)	end if
(5)
(6)	whiledo
(7)	ifthen
(8)
(9)	whiledo
(10)	,
(11)	end while
(12)
(13)
(14)
(15)	else
(16)	whiledo
(17)	= a random tuple in
(18)
(19)
(20)
(21)	end while
(22)	end if
(23)	end while
(24)	return