{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:37:53Z","timestamp":1764977873785,"version":"3.46.0"},"reference-count":32,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T00:00:00Z","timestamp":1560470400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12,18]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Privacy-preserving data mining (PPDM) is a novel approach that has emerged in the market to take care of privacy issues. The intention of PPDM is to build up data-mining techniques without raising the risk of mishandling of the data exploited to generate those schemes. The conventional works include numerous techniques, most of which employ some form of transformation on the original data to guarantee privacy preservation. However, these schemes are quite multifaceted and memory intensive, thus leading to restricted exploitation of these methods. Hence, this paper intends to develop a novel PPDM technique, which involves two phases, namely, data sanitization and data restoration. Initially, the association rules are extracted from the database before proceeding with the two phases. In both the sanitization and restoration processes, key extraction plays a major role, which is selected optimally using Opposition Intensity-based Cuckoo Search Algorithm, which is the modified format of Cuckoo Search Algorithm. Here, four research issues, such as hiding failure rate, information preservation rate, and false rule generation, and degree of modification are minimized using the adopted sanitization and restoration processes.<\/jats:p>","DOI":"10.1515\/jisys-2018-0420","type":"journal-article","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T05:15:23Z","timestamp":1560489323000},"page":"1441-1452","source":"Crossref","is-referenced-by-count":10,"title":["Opposition Intensity-Based Cuckoo Search Algorithm for Data Privacy Preservation"],"prefix":"10.1515","volume":"29","author":[{"given":"G.K.","family":"Shailaja","sequence":"first","affiliation":[{"name":"Department of IT , Kakatiya Institute of Technology and Science-Warangal , Telangana 506015 , India"}]},{"given":"C.V. Guru","family":"Rao","sequence":"additional","affiliation":[{"name":"Department of CSE , S.R. Engineering College , Warangal, Telangana 506371 , India"}]}],"member":"374","published-online":{"date-parts":[[2019,6,14]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"G. A. Afzali and S. Mohammadi, Privacy preserving big data mining: association rule hiding using fuzzy logic approach, IET Inform. Secur. 12 (2018), 15\u201324.","key":"2025120523341670735_j_jisys-2018-0420_ref_001","DOI":"10.1049\/iet-ifs.2015.0545"},{"doi-asserted-by":"crossref","unstructured":"A. Anjum, T. Ahmed, A. Khan, N. Ahmad and N. Farooq, Privacy preserving data by conceptualizing smart cities using MIDR-Angelization, Sustain. Cities Soc. 40 (2018), 326\u2013334.","key":"2025120523341670735_j_jisys-2018-0420_ref_002","DOI":"10.1016\/j.scs.2018.04.014"},{"doi-asserted-by":"crossref","unstructured":"A. Askarzadeh, A novel metaheuristic method for solving constrained engineering optimization problems: crow search algorithm, Comput. Struct. 169 (2016), 1\u201312.","key":"2025120523341670735_j_jisys-2018-0420_ref_003","DOI":"10.1016\/j.compstruc.2016.03.001"},{"doi-asserted-by":"crossref","unstructured":"S. Bennati and E. Pournaras, Privacy-enhancing aggregation of Internet of Things data via sensors grouping, Sustain. Cities Soc. 39 (2018), 387\u2013400.","key":"2025120523341670735_j_jisys-2018-0420_ref_004","DOI":"10.1016\/j.scs.2018.02.013"},{"doi-asserted-by":"crossref","unstructured":"H. K. Bhuyan and N. K. Kamila, Privacy preserving sub-feature selection in distributed data mining, Appl. Soft Comput. 36 (2015), 552\u2013569.","key":"2025120523341670735_j_jisys-2018-0420_ref_005","DOI":"10.1016\/j.asoc.2015.06.060"},{"doi-asserted-by":"crossref","unstructured":"M. A. P. Chamikara, P. Bertok, D. Liu, S. Camtepe and I. Khalil, Efficient data perturbation for privacy preserving and accurate data stream mining, Pervasive Mob. Comput. 48 (2018), 1\u201319.","key":"2025120523341670735_j_jisys-2018-0420_ref_006","DOI":"10.1016\/j.pmcj.2018.05.003"},{"doi-asserted-by":"crossref","unstructured":"Y. Dong and D. Pi, Novel privacy-preserving algorithm based on frequent path for trajectory data publishing, Knowl.-Based Syst. 148 (2018), 55\u201365.","key":"2025120523341670735_j_jisys-2018-0420_ref_007","DOI":"10.1016\/j.knosys.2018.01.007"},{"doi-asserted-by":"crossref","unstructured":"M. A. Ferrag, L. A. Maglaras, H. Janicke, J. Jiang and L. Shu, A systematic review of data protection and privacy preservation schemes for smart grid communications, Sustain. Cities Soc. 38 (2018), 806\u2013835.","key":"2025120523341670735_j_jisys-2018-0420_ref_008","DOI":"10.1016\/j.scs.2017.12.041"},{"doi-asserted-by":"crossref","unstructured":"F.-J. Gonz\u00e1lez-Serrano, \u00c1. Navia-V\u00e1zquez and A. Amor-Mart\u00edn, Training support vector machines with privacy-protected data, Pattern Recogn. 72 (2017), 93\u2013107.","key":"2025120523341670735_j_jisys-2018-0420_ref_009","DOI":"10.1016\/j.patcog.2017.06.016"},{"doi-asserted-by":"crossref","unstructured":"R. Jiang, R. Lu and K.-K. R. Choo, Achieving high performance and privacy-preserving query over encrypted multidimensional big metering data, Future Gener. Comput. Syst. 78 (2018), 392\u2013401.","key":"2025120523341670735_j_jisys-2018-0420_ref_010","DOI":"10.1016\/j.future.2016.05.005"},{"doi-asserted-by":"crossref","unstructured":"Y. Kokkinos and K. G. Margaritis, Confidence ratio affinity propagation in ensemble selection of neural network classifiers for distributed privacy-preserving data mining, Neurocomputing 150 (2015), 513\u2013528.","key":"2025120523341670735_j_jisys-2018-0420_ref_011","DOI":"10.1016\/j.neucom.2014.07.065"},{"doi-asserted-by":"crossref","unstructured":"E. G. Komishani, M. Abadi and F. Deldar, PPTD: preserving personalized privacy in trajectory data publishing by sensitive attribute generalization and trajectory local suppression, Knowl.-Based Syst. 94 (2016), 43\u201359.","key":"2025120523341670735_j_jisys-2018-0420_ref_012","DOI":"10.1016\/j.knosys.2015.11.007"},{"doi-asserted-by":"crossref","unstructured":"L. Li, R. Lu, K. K. R. Choo, A. Datta and J. Shao, Privacy-preserving-outsourced association rule mining on vertically partitioned databases, IEEE Trans. Inf. Foren. Sec. 11 (2016), 1847\u20131861.","key":"2025120523341670735_j_jisys-2018-0420_ref_013","DOI":"10.1109\/TIFS.2016.2561241"},{"doi-asserted-by":"crossref","unstructured":"Y. Li, J. Yang and W. Ji, Local learning-based feature weighting with privacy preservation, Neurocomputing 174 (2016), 1107\u20131115.","key":"2025120523341670735_j_jisys-2018-0420_ref_014","DOI":"10.1016\/j.neucom.2015.10.038"},{"doi-asserted-by":"crossref","unstructured":"J. C.-W. Lin, T.-Y. Wu, P. Fournier-Viger, G. Lin and M. Voznak, Fast algorithms for hiding sensitive high-utility item sets in privacy-preserving utility mining, Eng. Appl. Artif. Intel. 55 (2016), 269\u2013284.","key":"2025120523341670735_j_jisys-2018-0420_ref_015","DOI":"10.1016\/j.engappai.2016.07.003"},{"doi-asserted-by":"crossref","unstructured":"L. Liu, M. Kantarcioglu and B. Thuraisingham, The applicability of the perturbation based privacy preserving data mining for real-world data, Data Knowl. Eng. 65 (2008), 5\u201321.","key":"2025120523341670735_j_jisys-2018-0420_ref_016","DOI":"10.1016\/j.datak.2007.06.011"},{"doi-asserted-by":"crossref","unstructured":"M. Mareli and B. Twala, An adaptive Cuckoo search algorithm for optimisation, Appl. Comput. Inform. 14 (2017), 107\u2013115.","key":"2025120523341670735_j_jisys-2018-0420_ref_017","DOI":"10.1016\/j.aci.2017.09.001"},{"doi-asserted-by":"crossref","unstructured":"B. B. Mehta and U. P. Rao, Privacy preserving big data publishing: a scalable k-anonymization approach using MapReduce, IET Softw. 11 (2017), 271\u2013276.","key":"2025120523341670735_j_jisys-2018-0420_ref_018","DOI":"10.1049\/iet-sen.2016.0264"},{"doi-asserted-by":"crossref","unstructured":"C. Modi, U. P. Rao and D. R. Patel, A survey on preserving privacy for sensitive association rules in databases, in: International Conference on Business Administration and Information Processing, vol. 70, pp. 538\u2013544, Berlin, Heidelberg, 2010. https:\/\/doi.org\/10.1007\/978-3-642-12214-9_96.","key":"2025120523341670735_j_jisys-2018-0420_ref_019","DOI":"10.1007\/978-3-642-12214-9_96"},{"doi-asserted-by":"crossref","unstructured":"M. Prakash and G. Singaravel, An approach for prevention of privacy breach and information leakage in sensitive data mining, Comput. Electr. Eng. 45 (2015), 134\u2013140.","key":"2025120523341670735_j_jisys-2018-0420_ref_020","DOI":"10.1016\/j.compeleceng.2015.01.016"},{"doi-asserted-by":"crossref","unstructured":"T. Pranav Bhat, C. Karthik and K. Chandrasekaran, A privacy preserved data mining approach based on k-partite graph theory, Procedia Comput. Sci. 54 (2015), 422\u2013430.","key":"2025120523341670735_j_jisys-2018-0420_ref_021","DOI":"10.1016\/j.procs.2015.06.049"},{"doi-asserted-by":"crossref","unstructured":"X. Qi and M. Zong, An overview of privacy preserving data mining, Procedia Environ. Sci. 12 (2012), 1341\u20131347.","key":"2025120523341670735_j_jisys-2018-0420_ref_022","DOI":"10.1016\/j.proenv.2012.01.432"},{"doi-asserted-by":"crossref","unstructured":"P. Sui and X. Li, A privacy-preserving approach for multimodal transaction data integrated analysis, Neurocomputing 253 (2017), 56\u201364.","key":"2025120523341670735_j_jisys-2018-0420_ref_023","DOI":"10.1016\/j.neucom.2016.09.130"},{"doi-asserted-by":"crossref","unstructured":"K. K. Tripathi, Discrimination prevention with classification and privacy preservation in data mining, Procedia Comput. Sci. 79 (2016), 244\u2013253.","key":"2025120523341670735_j_jisys-2018-0420_ref_024","DOI":"10.1016\/j.procs.2016.03.032"},{"doi-asserted-by":"crossref","unstructured":"S. Upadhyay, C. Sharma, P. Sharma, P. Bharadwaj and K. R. Seeja, Privacy preserving data mining with 3-D rotation transformation, J. King Saud Univ. Comput. Inform. Sci. 30 (2016), 524\u2013530.","key":"2025120523341670735_j_jisys-2018-0420_ref_025","DOI":"10.1016\/j.jksuci.2016.11.009"},{"doi-asserted-by":"crossref","unstructured":"S. Vennila and J. Priyadarshini, Scalable privacy preservation in big data a survey, Procedia Comput. Sci. 50 (2015), 369\u2013373.","key":"2025120523341670735_j_jisys-2018-0420_ref_026","DOI":"10.1016\/j.procs.2015.04.033"},{"doi-asserted-by":"crossref","unstructured":"T. D. Vrionis, X. I. Koutiva and N. A. Vovos, A genetic algorithm-based low voltage ride-through control strategy for grid connected doubly fed induction wind generators, IEEE Trans. Power Syst. 29 (2014), 1325\u20131334.","key":"2025120523341670735_j_jisys-2018-0420_ref_027","DOI":"10.1109\/TPWRS.2013.2290622"},{"doi-asserted-by":"crossref","unstructured":"A. Waqar, A. Raza, H. Abbas and M. K. Khan, A framework for preservation of cloud users\u2019 data privacy using dynamic reconstruction of metadata, J. Netw. Comput. Appl. 36 (2013), 235\u2013248.","key":"2025120523341670735_j_jisys-2018-0420_ref_028","DOI":"10.1016\/j.jnca.2012.09.001"},{"doi-asserted-by":"crossref","unstructured":"R. Wei, H. Tian and H. Shen, Improving k-anonymity based privacy preservation for collaborative filtering, Comput. Electr. Eng. 67 (2018), 509\u2013519.","key":"2025120523341670735_j_jisys-2018-0420_ref_029","DOI":"10.1016\/j.compeleceng.2018.02.017"},{"doi-asserted-by":"crossref","unstructured":"U. Yun and J. Kim, A fast perturbation algorithm using tree structure for privacy preserving utility mining, Expert Syst. Appl. 42 (2015), 1149\u20131165.","key":"2025120523341670735_j_jisys-2018-0420_ref_030","DOI":"10.1016\/j.eswa.2014.08.037"},{"doi-asserted-by":"crossref","unstructured":"J. Zhang and P. Xia, An improved PSO algorithm for parameter identification of nonlinear dynamic hysteretic models, J. Sound Vib. 389 (2017), 153\u2013167.","key":"2025120523341670735_j_jisys-2018-0420_ref_031","DOI":"10.1016\/j.jsv.2016.11.006"},{"doi-asserted-by":"crossref","unstructured":"L. M. Zheng, S. X. Zhang, K. S. Tang and S. Y. Zheng, Differential evolution powered by collective information, Inform. Sci. 399 (2017), 13\u201329.","key":"2025120523341670735_j_jisys-2018-0420_ref_032","DOI":"10.1016\/j.ins.2017.02.055"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/29\/1\/article-p1441.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0420\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0420\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:34:56Z","timestamp":1764977696000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2018-0420\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,14]]},"references-count":32,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,9,20]]},"published-print":{"date-parts":[[2019,12,18]]}},"alternative-id":["10.1515\/jisys-2018-0420"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2018-0420","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2019,6,14]]}}}