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

Algorithm 1

The Greedy 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)	is a randomly selected record in
(6)	whiledo
(7)	the furthest record from
(8)
(9)
(10)	whiledo
(11)
(12)
(13)
(14)	end while
(15)
(16)	ifthen
(17)	whiledo
(18)	= a random tuple in
(19)
(20)
(21)
(22)	end while
(23)	end if
(24)	end while
(25)	return