1. Aggarwal G, Feder T, Kenthapadi K, Motwani R, Panigrahy R, Thomas D, Zhu A. Approximation algorithms for k-anonymity. J Priv Technol. 2005.
http://ilpubs.stanford.edu:8090/645/
2. Bayardo RJ, Rakesh A. Data privacy through optimal k-anonymization. In: 21st international conference on data engineering (ICDE’05). 2005. p. 217–28.
https://doi.org/10.1109/ICDE.2005.42
3. Bredereck R, Froese V, Hartung S, Nichterlein A, Niedermeier R, Talmon N. The complexity of degree anonymization by vertex addition. In: Gu Q, Hell P, Yang B, editors. Algorithmic aspects in information and management. Cham: Springer International Publishing; 2014. p. 44–55.
4. Burke R. Knowledge-Based Recommender Systems. In: Encyclopedia of library and information systems; 2000
5. Byun JW, Kamra A, Bertino E, Li N. Efficient k-anonymization using clustering techniques. In: Kotagiri R, Krishna PR, Mohania M, Nantajeewarawat E, editors. Advances in databases: concepts, systems and applications. Berlin: Springer; 2007. p. 188–200.