Improved Privacy Preserving decision tree Approach for Network Intrusion Detection

  IJCOT-book-cover
 
International Journal of Computer & Organization Trends  (IJCOT)          
 
© 2016 by IJCOT Journal
Volume - 6 Issue - 1
Year of Publication : 2016
AuthorsS.Navya Sai, K.KishoreRaju
  10.14445/22492593/IJCOT-V30P301

MLA

S.Navya Sai, K.KishoreRaju"Improved Privacy Preserving decision tree Approach for Network Intrusion Detection", International Journal of Computer & organization Trends (IJCOT), V6(1):55-60 Jan - Feb 2016, ISSN:2249-2593, www.ijcotjournal.org. Published by Seventh Sense Research Group.

Abstract With the size of the data increases, privacy preserving plays a vital role in machine learning models. Privacy preserving becomes popular due to its privacy sensitive attributes for data analysis and decision making system.Machine learning has been used and applied in many areas including business development and internet of things. But, machine learning models occur serious problems due to its sensitive information and privacy violation. Privacy preserving data mining protects the sensitive information from disclosure without the permission of data providers. In this model, a novel privacy preserving data mining model was designed to protect the sensitive attributes in the KDD99 dataset.Experimental results show that proposed model has high true positive rate along with sensitive information compared to traditional models.

References-

[1] D. Agrawal and C.C. Aggarwal, “On the Design and Quantification of Privacy Preserving Data Mining Algorithms,” Proc. 20th ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems (PODS ‟01), pp. 247-255, May 2001.
[2] R. Agrawal and R. Srikant, “Privacy Preserving Data Mining,” Proc. ACM SIGMOD Int‟l Conf. Management of Data (SIGMOD ‟00), 2000.
[3] K. Chen and L. Liu, “Privacy Preserving Data Classification with Rotation Perturbation,” Proc. IEEE Fifth Int‟l Conf. Data Mining, 2005.
[4] Z. Huang, W. Du, and B. Chen, “Deriving Private Information From Randomized Data,” Proc. ACM SIGMOD Int‟l Conf. Management of Data (SIGMOD), 2005.
[5] F. Li, J. Sun, S. Papadimitriou, G. Mihaila, and I. Stanoi, “Hiding in the Crowd: Privacy Preservation on Evolving Streams Through Correlation Tracking,” Proc. IEEE 23rd Int‟l Conf. Data Eng. (ICDE), 2007.
[6] G. Jagannathan, K. Pillaipakkamnatt, and R.N. Wright, “A Practical Differentially Private Random Decision Tree Classifier,” Proc. IEEE Int‟l Conf. Data Mining Workshops (ICDMW ‟09), pp. 114-121, 2009.
[7] J. Vaidya, C. Clifton, M. Kantarcioglu, and A.S. Patterson, “Privacy-Preserving Decision Trees over Vertically Partitioned Data,” ACM Trans. Knowledge Discovery from Data, vol. 2, no. 3, pp. 1-27, 2008.
[8] M. Kantarcioglu and C. Clifton. Privately computing a distributed k-nn classifier. In J.-F. Boulicaut, F. Esposito, F. Giannotti, and D. Pedreschi, editors, PKDD, volume 3202 of Lecture Notes in Computer Science, pages 279–290. Springer, 2004.
[9] J. Domingo-Ferrer and V. Torra, “A Quantitative Comparison of Disclosure Control Methods for Microdata,” Confidentiality, Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies, P. Doyle, J. Lane, J. Theeuwes, and L. Zayatz, eds., pp. 111-134, Amsterdam: North-Holland, 2001.
[10] J. Domingo-Ferrer and V. Torra, “Ordinal, Continuous and Heterogeneous k- Anonymity through Microaggregation,” Data Mining and Knowledge Discovery, vol. 11, no. 2, pp. 195-212, 2005

Keywords-
NID, P R I V ACY R E S E R VING.