Advancement in technology and web based activities has increased the size of data sets which may cause the risk of re-identification about individual’s information. Multifarious techniques have been suggested for anonymizing the data sets. Aforesaid techniques ensure the individual’s identity to remain anonymous. As a result of that, privacy preservation in the field of data publishing has become an active area for research. In this paper an evaluation of various k-anonymity algorithms has been carried out with the objective of identifying the value of discernibility that occurs due to anonymization. An experiment has been performed to determine the value of discernibility based on the type of attribute(s) on three publically available data sets that carries different dimensions.

Metrics, Discernibility Metric(DM) , Equivalence Class, Privacy Preserving Data Publishing (PPDP), Quasi identifier (QID), American Time Use Survey (ATUS)

[1] L. Sweeney. “Achieving k-anonymity privacy protection using generalization and suppression”, International Journal on Uncertainty, Fuzziness, and Knowledge-based Systems, 10(5):571{588, 2002}.
[2] Kristen Lefebvre, David J. DeWitt. “Mondrian Multidimensional K-Anonymity” , In proceeding of 22nd International Conference on Data Engineering, ICDE’06, page 25,2006.
[3] Kristen Lefebvre, David J. DeWitt,Raghu Ramakrishnan. Incognito: “Efficient Full-Domain K-Anonymity”, SIGMOD 2005 June 14-16, 2005, Baltimore, Maryland, USA Copyright 2005 ACM 1-59593-060-4/05/06.
[4] J. Gantz and D. Reinsel. “The digital universe in 2020: Big Data, Bigger Digital Shadows, and Biggest Growth in the Far East”. Technical report, IDC, sponsored by EMC, December, 2012.
[5] M.Manigandan and K. Aravind Kumar, "Secure Multiparty Protocol for Distributed Mining of Association Rules", International Journal of Scientific Research in Computer Science and Engineering, Vol.3, Issue.1, pp.6-10, 2015.
[6] Lamba S. and Abbas S. Qamar, “Model for Privacy Preserving of Sensitive Data”, International Journal of Technical Research and Applications, Vol 1, e-ISSN: 2320-8163, PP 07-11, July-August, 2013.
[7] J. Soria-Comas , J. Domingo-Ferrer, D. Sanchez, and S. Martınez, “Improving the Utility of Differentially Private Data Releases via k-Anonymity” , In Proceedings of the 12th IEEE International Conference on Trust , Security and Privacy in Computing and Communications, TRUSTCOM 13, pages 372–379, 2013.
[8] P. Samarati. “Protecting respondents` identities in microdata release”, IEEE Trans. on Knowledge and Data Engineering, 13(6), 2001.
[9] A. Machanavajjhala, J. Gehrke, D. Kifer,and M. Venkitasubramaniam”, l-diversity:Privacy beyond k-anonymity”. In proceeding Of the 22nd IEEE International Conference on Data Engineering (ICDE),Atlanta , GA, 2006.
[10] N.Li,T. Li., “t-closeness: Privacy beyond k-anonymity and l- diversity”, Proceedings of 21st IEEE International Con ference on Data Engineering ICDE), Istanbul, Turkey, April 2007.
[11] R.CW. Wong, J. Li,a.WC.Fu, and Ke. “Wang.(α,k)- Anonymity: An Enhanced k-Anonymity Model For Privacy Preserving Data Publishing” , In Proceeeding of 12th International Conference on Knowledge Discovery and Data Mining pp754-759, Philadelphia,PA, 2006.
[12] Bayardo, R. J. and Agrawal, R., “Data Privacy Through Optimal k-Anonymization”, In Proceedings of the 21st International Conference on Data Engineering, ICDE 05, pages 217–228, 2005.
[13] Nergiz, M. E. and Clifton, C. “Thoughts on k-Anonymization”, Data and Knowledge Engineering, 63(3):622–645, 2007.
[14]DataSource:https://drive.google.com/open?id=0B1QMEQlbBZ9zMy1LU0FEaXprem8
[15] Manjusha S. Mirashe, Kapil N. Hande, “Survey on Efficient Technique for Annonymized Microdata Preservation” ,International Journal of Emerging and Development, 2015, Vol.2, Issue 5, ISSN 2249-6149, pp 97-103, March,2015.
[16] UTD Anonymization Toolbox. http://cs.utdallas.edu/dspl/cgi-bin/toolbox/