An association rule is classified as sensitive if its thread of revelation is above certain confidence value. If these sensitive rules were revealed to the public, it is possible to deduce sensitive knowledge from the published data and offers benefit for the business competitors. Earlier studies in privacy preserving association rule mining focus on binary data and has more side effects. But in practical applications the transactions contain the purchased quantities of the items. Hence preserving privacy of quantitative data is essential. The main goal of the proposed system is to hide a group of interesting patterns which contains sensitive knowledge such that modifications have minimum side effects like lost rules, ghost rules, and number of modifications. The proposed system applies Particle Swarm Optimization to a few clusters of particles thus reducing the number of modification. Experimental results demonstrate that the proposed approach is efficient in terms of lost rules, number of modifications, hiding failure with complete avoidance of ghost rules.<\/p>","DOI":"10.4018\/ijiit.2017040101","type":"journal-article","created":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T15:56:27Z","timestamp":1488815787000},"page":"1-20","source":"Crossref","is-referenced-by-count":18,"title":["Privacy Preserving Fuzzy Association Rule Mining in Data Clusters Using Particle Swarm Optimization"],"prefix":"10.4018","volume":"13","author":[{"given":"Sathiyapriya","family":"Krishnamoorthy","sequence":"first","affiliation":[{"name":"PSG College of Technology, Department of Computer Science & Engineering, Tamil Nadu, India"}]},{"given":"G. Sudha","family":"Sadasivam","sequence":"additional","affiliation":[{"name":"PSG College of Technology, Department of Computer Science & Engineering, Tamil Nadu, India"}]},{"given":"M.","family":"Rajalakshmi","sequence":"additional","affiliation":[{"name":"Coimbatore Institute of Technology, Department of Computer Science & Engineering, Tamil Nadu, India"}]},{"given":"K.","family":"Kowsalyaa","sequence":"additional","affiliation":[{"name":"PSG College of Technology, Department of Computer Science & Engineering, Tamil Nadu, India"}]},{"given":"M.","family":"Dhivya","sequence":"additional","affiliation":[{"name":"SSN College of Engineering, Department of Computer Science & Engineering, Tamil Nadu, India"}]}],"member":"2432","reference":[{"key":"IJIIT.2017040101-0","doi-asserted-by":"publisher","DOI":"10.4018\/ijiit.2014010103"},{"key":"IJIIT.2017040101-1","doi-asserted-by":"publisher","DOI":"10.4018\/jiit.2006010104"},{"key":"IJIIT.2017040101-2","doi-asserted-by":"publisher","DOI":"10.4018\/jiit.2005010104"},{"key":"IJIIT.2017040101-3","doi-asserted-by":"crossref","unstructured":"Berberoglu, T., & Kaya, M. (2008). Hiding Fuzzy Association Rules in Quantitative Data. The 3rd International Conference on Grid and Pervasive Computing \u2013 Workshops, 387-392.","DOI":"10.1109\/GPC.WORKSHOPS.2008.33"},{"key":"IJIIT.2017040101-4","first-page":"68","article-title":"Mining association rules with weighted items.","author":"C. H.Cai","year":"1998","journal-title":"Proceedings of the International Database Engineering and Applications Symposium"},{"key":"IJIIT.2017040101-5","doi-asserted-by":"crossref","unstructured":"Dehkordi, M. N., Badie, K., & Zadeh, A. K. (2009). A Novel Method for Privacy Preserving in Association Rule Mining Based on Genetic Algorithms. Journal of software, 4(6), 555-562.","DOI":"10.4304\/jsw.4.6.555-562"},{"key":"IJIIT.2017040101-6","doi-asserted-by":"crossref","unstructured":"Duraiswamy, K., Manjula, D., & Maheswari, N. (2010). A New Approach to Sensitive Rule Hiding. ccsenet journal, 1(3), 107-111.","DOI":"10.5539\/cis.v1n3p107"},{"key":"IJIIT.2017040101-7","doi-asserted-by":"publisher","DOI":"10.1145\/772862.772869"},{"key":"IJIIT.2017040101-8","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Srikant, R., Agrawal, R., & Gehrke, J. (2002). Privacy preserving mining of association rules. Proceedings of the8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 217\u2013228). ACM Press.","DOI":"10.1145\/775047.775080"},{"key":"IJIIT.2017040101-9","unstructured":"Frank, A., & Asuncion, A. (2010). UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA, USA. Retrieved from http:\/\/archive.ics.uci.edu\/ml"},{"key":"IJIIT.2017040101-10","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2012.2221854"},{"key":"IJIIT.2017040101-11","first-page":"51","article-title":"Reconstruction-Based Association Rule Hiding.","author":"Y.Guo","year":"2007","journal-title":"Proceedings of SIGMOD2007 Ph.D. Workshop on Innovative Database Research 2007"},{"key":"IJIIT.2017040101-12","doi-asserted-by":"publisher","DOI":"10.7763\/IJCTE.2009.V1.60"},{"key":"IJIIT.2017040101-13","first-page":"420","article-title":"Discovery of multiple-level association rules from large database.","author":"J.Han","year":"1995","journal-title":"Proceedings of the 21st International Conference on Very Large Data Bases"},{"key":"IJIIT.2017040101-14","doi-asserted-by":"publisher","DOI":"10.1016\/S1088-467X(99)00028-1"},{"key":"IJIIT.2017040101-15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250908"},{"key":"IJIIT.2017040101-16","doi-asserted-by":"publisher","DOI":"10.4018\/jiit.2010100103"},{"issue":"3","key":"IJIIT.2017040101-17","first-page":"116","article-title":"Mining the data from distributed database using an improved mining algorithm.","volume":"7","author":"K.Renjit","year":"2010","journal-title":"International Journal of Computer Science and Information Security"},{"key":"IJIIT.2017040101-18","doi-asserted-by":"crossref","unstructured":"Sathiyapriya, K., Sudha, G., & Karthikeyan, V.B. (2012). A New Method for Preserving Privacy in Quantitative Association Rules using Genetic Algorithm. International journal of computer Applications, 60(12), 12-19.","DOI":"10.5120\/9743-4295"},{"key":"IJIIT.2017040101-19","doi-asserted-by":"crossref","unstructured":"Sathiyapriya, K., Sudhasadasivam, G., & Celin, N. (2011). A New Method for preserving privacy in Quantitative Association Rules Using DSR Approach With Automated Generation of Membership Function. Proceedings of World Congress on Information and Communication Technologies, Mumbai (pp. 48-153).","DOI":"10.1109\/WICT.2011.6141234"},{"key":"IJIIT.2017040101-20","first-page":"78","article-title":"Hiding Sensitive Fuzzy Association rules Using Weighted Item Grouping and Rank Based Correlated Rule Hiding Algorithm","volume":"13","author":"K.Sathiyapriya","year":"2014","journal-title":"WSEAS Transactions on Computers"},{"key":"IJIIT.2017040101-21","doi-asserted-by":"publisher","DOI":"10.1145\/604264.604271"},{"key":"IJIIT.2017040101-22","first-page":"407","article-title":"Mining generalized association rules.","author":"R.Srikant","year":"1995","journal-title":"Proceedings of the 21st International Conference on Very Large Data Bases"},{"key":"IJIIT.2017040101-23","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233311"},{"key":"IJIIT.2017040101-24","unstructured":"Sudha, G., Sangeetha, S., & Sathiyapriya, K. (2012). Privacy Preservation with Attribute Reduction in Quantitative Association Rules using PSO and DSR. International Journal of Computer Applications on Information Processing and Remote Computing."},{"key":"IJIIT.2017040101-25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1269668"},{"key":"IJIIT.2017040101-26","doi-asserted-by":"publisher","DOI":"10.1109\/IRI-05.2005.1506477"},{"key":"IJIIT.2017040101-27","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2006.05.022"},{"key":"IJIIT.2017040101-28","first-page":"753","article-title":"A Novel Algorithm for Completely Hiding Sensitive Frequent Itemset.","author":"C. C.Weng","year":"2007","journal-title":"Proceedings of the eighth International Symposium on Advanced Intelligent Systems"},{"key":"IJIIT.2017040101-29","doi-asserted-by":"publisher","DOI":"10.1109\/ISDA.2008.180"},{"key":"IJIIT.2017040101-30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.250583"},{"key":"IJIIT.2017040101-31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.9"},{"key":"IJIIT.2017040101-32","doi-asserted-by":"crossref","unstructured":"Yao, A. C. (1986). How to generate and exchange secrets. Proceedings of the27th IEEE Symposium on Foundations of Computer Science (pp. 162\u2013167).","DOI":"10.1109\/SFCS.1986.25"},{"key":"IJIIT.2017040101-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.04.001"},{"key":"IJIIT.2017040101-34","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90241-X"},{"key":"IJIIT.2017040101-35","first-page":"1","article-title":"Distributed data mining with differential privacy.","author":"N.Zhang","year":"2011","journal-title":"Proceedings of the IEEE International Conference on Communications(ICC)"}],"container-title":["International Journal of Intelligent Information Technologies"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=179297","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T20:42:27Z","timestamp":1651869747000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJIIT.2017040101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2017,4,1]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijiit.2017040101","relation":{},"ISSN":["1548-3657","1548-3665"],"issn-type":[{"value":"1548-3657","type":"print"},{"value":"1548-3665","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,1]]}}}