International Journal of Information Engineering and Electronic Business (IJIEEB)
IJIEEB Vol. 4, No. 3, 8 Jul. 2012
Cover page and Table of Contents: PDF (size: 248KB)
Author(s)
Anish Gupta
1,*
Vimal Bibhu
1
Md. Rashid Hussain
1
Index Terms
Artificial Neural Networks, CART – Classification and Regression Tree, CHAID – Chi Square Automatic Interaction, Detection, Genetic Algorithm
Abstract
Data mining is a technique to dig the data from the large databases for analysis and executive decision making. Security aspect is one of the measure requirement for data mining applications. In this paper we present security requirement measures for the data mining. We summarize the requirements of security for data mining in tabular format. The summarization is performed by the requirements with different aspects of security measure of data mining. The performances and outcomes are determined by the given factors under the summarization criteria. Effects are also given under the tabular form for the requirements of different parameters of security aspects.
Cite This Paper
Anish Gupta, Vimal Bibhu, Rashid Hussain, "Security Measures in Data Mining", International Journal of Information Engineering and Electronic Business(IJIEEB), vol.4, no.3, pp.34-39, 2012. DOI:10.5815/ijieeb.2012.03.05
Reference
[1]Rakesh Agrawal, Tomasz Imieliski, and Arun Swami. Mining association rulesbetween sets of items in large databases. In Proceedings of the 1993 ACM SIG-MOD international conference on Management of data, pages 207{216. ACM Press, 1993.
[2]Varun Chandola and Vipin Kumar. Summarization { compressing data into an informative representation. In Fifth IEEE International Conference on Data Mining, pages 98{105, Houston, TX, November 2005.
[3]Levent ErtÄoz, Eric Eilertson, Aleksander Lazarevic, Pang-Ning Tan, Vipin Kumar, Jaideep Srivastava, and Paul Dokas. MINDS - Minnesota Intrusion Detection System. In Data Mining - Next Generation Challenges and Future Directions. MIT Press, 2004.
[4]Anil K. Jain and Richard C. Dubes. Algorithms for Clustering Data. Prentice Hall, Inc., 1988.
[5]Pawlak, Z. (1990). Rough sets. Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, 1992
[6]Lin, T. Y. (1993), "Rough Patterns in Data-Rough Sets and Intrusion Detection Systems", Journal of Foundation of Computer Science and Decision Support, Vol.18, No. 3-4, 1993. pp. 225- 241. The extended version of "Patterns in Data-Rough Sets and Foundation of Intrusion Detection Systems" presented at the First Invitational Workshop on Rough Sets, Poznan-Kiekrz, September 2-4. 1992.
[7]Shariq J. Rizvi and Jayant R. Haritsa. Maintaining data privacy in association rule mining. In Proceedings of 28th International Conference on Very Large Data Bases. VLDB, August 20-23 2002. URL http://www.vldb.org.
[8]Oded Goldreich. Secure multi-party computation, September 1998. URL http: //www.wisdom.weizmann.ac.il/~oded/pp.html. (working draft).
[9]Yehuda Lindell and Benny Pinkas. Privacy preserving data mining. In Ad- vances in Cryptology { CRYPTO 2000, pages 36{54. Springer-Verlag, August 20-24 2000. URL http://link.springer.de/link/service/series/0558/bibs/1880/ 18800036.htm.
[10]Jaideep Shrikant Vaidya and Chris Clifton. Privacy preserving association rule mining in vertically partitioned data. In The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 23-26 2002.
[11]Chris Clifton. Using sample size to limit exposure to data mining. Journal of Computer Security, 8(4):281{307, November 2000. URL http://iospress.metapress.com/openurl.asp?genre=artcle&issn=0926227X&volume=8&issue=4&spage=281.
[12]Xiaodong Lin and Chris Clifton. Distributed EM clustering without sharing local information. Journal of Information Science, February 2003. Submitted to Special Issue on Knowledge Discovery from Distributed Information Sources.