{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T19:10:21Z","timestamp":1772824221880,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T00:00:00Z","timestamp":1689811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T00:00:00Z","timestamp":1689811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"SERB-DST India","award":["SB\/S9\/Z-03\/2017-XX (2019-20)"],"award-info":[{"award-number":["SB\/S9\/Z-03\/2017-XX (2019-20)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s10489-023-04781-4","type":"journal-article","created":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T02:01:59Z","timestamp":1689818519000},"page":"24275-24292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Statistical limitations of sensitive itemset hiding methods"],"prefix":"10.1007","volume":"53","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0265-6770","authenticated-orcid":false,"given":"Jangra","family":"Shalini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshniwal","family":"Durga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clifton","family":"Chris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,20]]},"reference":[{"key":"4781_CR1","unstructured":"Han J, Pei J, Kamber M (2011) Data mining: concepts and techniques"},{"issue":"2","key":"4781_CR2","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM SIGMOD Record 22(2):207\u2013216","journal-title":"ACM SIGMOD Record"},{"key":"4781_CR3","unstructured":"Martin E, Hans-Peter K, J\u00f6rg S, Xiaowei X, Evangelos Si, Jiawei H, Usama MF (eds)(1996) A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96) Portland, Oregon, USA, p 226\u2013231, http:\/\/www.aaai.org\/Library\/KDD\/1996\/kdd96-037.php"},{"issue":"1","key":"4781_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10115-008-0128-4","volume":"17","author":"N Tatti","year":"2008","unstructured":"Tatti N (2008) Maximum entropy based significance of itemsets. Knowl Inf Syst 17(1):57\u201377","journal-title":"Knowl Inf Syst"},{"key":"4781_CR5","unstructured":"Clifton C, Marks D (1996) Security and privacy implications of data mining, ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, Citeseer p 15\u201319"},{"key":"4781_CR6","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (2000) Privacy-preserving data mining, Proceedings of the 2000 ACM SIGMOD international conference on Management of data, p 439\u2013450","DOI":"10.1145\/342009.335438"},{"key":"4781_CR7","unstructured":"Oliveira SR, Zaiane Osmar R (2002) Privacy preserving frequent itemset mining, Proceedings of the IEEE international conference on Privacy, security and data mining, Australian Computer Society, Inc. Vol 14 p 43\u201354"},{"key":"4781_CR8","unstructured":"Sharma S, Toshniwal D (2018) MR-I MaxMin-scalable two-phase border based knowledge hiding technique using MapReduce, Futur Gener Comput Syst"},{"key":"4781_CR9","unstructured":"Daniel EOL (1991) Knowledge Discovery as a Threat to Database Security, Proceedings of the 1st International Conference on Knowledge Discovery and Databases, vol 107 p 516"},{"key":"4781_CR10","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Philip SY (2008) A general survey of privacy-preserving data mining models and algorithms, Privacy-preserving data mining p 11\u201352","DOI":"10.1007\/978-0-387-70992-5_2"},{"key":"4781_CR11","unstructured":"Atallah M, Bertino E, Elmagarmid A, Ibrahim M, Verykios V (1999) Disclosure limitation of sensitive rules, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX\u201999)(Cat. No. PR00453), IEEE p 45\u201352"},{"key":"4781_CR12","doi-asserted-by":"crossref","unstructured":"Vaidya J, Clifton C (2002) Privacy preserving association rule mining in vertically partitioned data, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM p 639\u2013644","DOI":"10.1145\/775047.775142"},{"key":"4781_CR13","doi-asserted-by":"crossref","unstructured":"Saygin Y, Verykios VS, Elmagarmid AK (2002) Privacy preserving association rule mining, Proceedings Twelfth International Workshop on Research Issues in Data Engineering: Engineering E-Commerce\/E-Business Systems RIDE-2EC IEEE p 151\u2013158","DOI":"10.1109\/RIDE.2002.995109"},{"issue":"1","key":"4781_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.datak.2007.06.012","volume":"65","author":"GV Moustakides","year":"2008","unstructured":"Moustakides GV, Verykios VS (2008) A maxmin approach for hiding frequent itemsets. Data & Knowledge Engineering 65(1):75\u201389","journal-title":"Data & Knowledge Engineering"},{"key":"4781_CR15","doi-asserted-by":"crossref","unstructured":"Gkoulalas-Divanis A, Verykios VS (2006) An integer programming approach for frequent itemset hiding, Proceedings of the 15th ACM international conference on Information and knowledge management, p 748\u2013757","DOI":"10.1145\/1183614.1183721"},{"issue":"5","key":"4781_CR16","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TKDE.2008.199","volume":"21","author":"A Gkoulalas-Divanis","year":"2008","unstructured":"Gkoulalas-Divanis A, Verykios VS (2008) Exact knowledge hiding through database extension. IEEE Transactions on Knowledge and Data Engineering 21(5):699\u2013713","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"6","key":"4781_CR17","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1016\/j.is.2012.11.005","volume":"38","author":"V Dinusha","year":"2013","unstructured":"Dinusha V, Peter C, Vassilios SV (2013) A taxonomy of privacy-preserving record linkage techniques. Info Syst 38(6):946\u2013969. https:\/\/doi.org\/10.1016\/j.is.2012.11.005","journal-title":"Info Syst"},{"issue":"3","key":"4781_CR18","doi-asserted-by":"publisher","first-page":"2539","DOI":"10.1007\/s10489-021-02490-4","volume":"52","author":"VS Verykios","year":"2022","unstructured":"Verykios VS, Stavropoulos EC, Krasadakis P, Sakkopoulos E (2022) Frequent itemset hiding revisited: pushing hiding constraints into mining. Appl Intell 52(3):2539\u20132555","journal-title":"Appl Intell"},{"issue":"1","key":"4781_CR19","first-page":"74","volume":"1","author":"X Sun","year":"2007","unstructured":"Sun X, Yu PS (2007) Hiding sensitive frequent itemsets by a border-based approach. J Comput Sci Eng, Korean Institute of Information Scientists and Engineers 1(1):74\u201394","journal-title":"J Comput Sci Eng, Korean Institute of Information Scientists and Engineers"},{"issue":"4","key":"4781_CR20","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/s10489-012-0377-5","volume":"38","author":"TP Hong","year":"2013","unstructured":"Hong TP, Lin CW, Yang KT, Wang SL (2013) Using TF-IDF to hide sensitive itemsets. Appl Intell 38(4):502\u2013510","journal-title":"Appl Intell"},{"issue":"1","key":"4781_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/j.dss.2006.08.007","volume":"43","author":"A Amiri","year":"2007","unstructured":"Amiri A (2007) Dare to share: Protecting sensitive knowledge with data sanitization. Decision Support Systems 43(1):181\u2013191","journal-title":"Decision Support Systems"},{"key":"4781_CR22","doi-asserted-by":"crossref","unstructured":"Lin CW Hong TP, Hsu HC (2014) Reducing side effects of hiding sensitive itemsets in privacy preserving data mining, Sci World J. vol 2014","DOI":"10.1155\/2014\/235837"},{"issue":"2","key":"4781_CR23","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10489-015-0671-0","volume":"44","author":"P Cheng","year":"2016","unstructured":"Cheng P, Roddick JF, Chu SC, Lin CW (2016) Privacy preservation through a greedy, distortion-based rule-hiding method. Appl Intell. 44(2):295\u2013306","journal-title":"Appl Intell."},{"issue":"2","key":"4781_CR24","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10489-014-0590-5","volume":"42","author":"CW Lin","year":"2015","unstructured":"Lin CW, Hong TP, Yang KT, Wang SL (2015) The GA-based algorithms for optimizing hiding sensitive itemsets through transaction deletion. Appl Intell 42(2):210\u2013230","journal-title":"Appl Intell"},{"key":"4781_CR25","doi-asserted-by":"crossref","unstructured":"Lin CW, Zhang B, Yang KT, Hong TP (2014) Efficiently hiding sensitive itemsets with transaction deletion based on genetic algorithms, Sci World J. vol 2014","DOI":"10.1155\/2014\/398269"},{"key":"4781_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2016.03.007","volume":"53","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Liu Q, Fournier-Viger P, Hong TP, Voznak M, Zhan J (2016) A sanitization approach for hiding sensitive itemsets based on particle swarm optimization. Eng Appl Artif Intell 53:1\u201318","journal-title":"Eng Appl Artif Intell"},{"key":"4781_CR27","doi-asserted-by":"publisher","first-page":"10024","DOI":"10.1109\/ACCESS.2017.2702281","volume":"5","author":"JMT Wu","year":"2017","unstructured":"Wu JMT, Zhan J, Lin JCW (2017) Ant colony system sanitization approach to hiding sensitive itemsets. IEEE Access 5:10024\u201310039","journal-title":"IEEE Access"},{"key":"4781_CR28","unstructured":"Kullback S (1997) Information theory and statistics, Courier Corporation"},{"issue":"3","key":"4781_CR29","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. The Bell syst tech J, Nokia Bell Labs 27(3):379\u2013423","journal-title":"The Bell syst tech J, Nokia Bell Labs"},{"key":"4781_CR30","doi-asserted-by":"crossref","unstructured":"Hawkins DM (1980) Identification of outliers vol 11","DOI":"10.1007\/978-94-015-3994-4"},{"key":"4781_CR31","doi-asserted-by":"crossref","unstructured":"Ben-Gal I (2005) Outlier detection, Data mining and knowledge discovery handbook, p 131\u2013146","DOI":"10.1007\/0-387-25465-X_7"},{"issue":"2","key":"4781_CR32","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1023\/B:AIRE.0000045502.10941.a9","volume":"22","author":"V Hodge","year":"2004","unstructured":"Hodge V, Austin J (2004) A survey of outlier detection methodologies. Artif intell rev 22(2):85\u2013126","journal-title":"Artif intell rev"},{"key":"4781_CR33","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.future.2021.10.008","volume":"128","author":"S Jangra","year":"2022","unstructured":"Jangra S, Toshniwal D (2022) Efficient algorithms for victim item selection in privacy-preserving utility mining. Futur Gener Comput Syst 128:219\u2013234","journal-title":"Futur Gener Comput Syst"},{"key":"4781_CR34","doi-asserted-by":"crossref","unstructured":"Jangra S, Toshniowal D (2019) A Heuristic Approach for Sensitive Pattern Hiding with Improved Data Quality, International Workshop on New Frontiers in Mining Complex Patterns, p 21\u201335","DOI":"10.1007\/978-3-030-48861-1_2"},{"issue":"5","key":"4781_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2020.102255","volume":"57","author":"S Jangra","year":"2020","unstructured":"Jangra S, Toshniwal D (2020) VIDPSO: Victim item deletion based PSO inspired sensitive pattern hiding algorithm for dense datasets. Inf Process Manag 57(5):102255","journal-title":"Inf Process Manag"},{"key":"4781_CR36","doi-asserted-by":"crossref","unstructured":"Oliveira SRM, Zaiane OR (2003) Protecting sensitive knowledge by data sanitization, Third IEEE International conference on data mining, p 613\u2013616","DOI":"10.1109\/ICDM.2003.1250990"},{"key":"4781_CR37","doi-asserted-by":"crossref","unstructured":"Dasseni E, Verykios VS, Elmagarmid AK, Bertino E (2001) Hiding association rules by using confidence and support, International Workshop on Information Hiding, p 369\u2013383","DOI":"10.1007\/3-540-45496-9_27"},{"issue":"1","key":"4781_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-017-0064-9","volume":"4","author":"S Sharma","year":"2017","unstructured":"Sharma S, Toshniwal D (2017) Scalable two-phase co-occurring sensitive pattern hiding using mapreduce. J. Big Data 4(1):1\u201318","journal-title":"J. Big Data"},{"issue":"1","key":"4781_CR39","first-page":"73","volume":"1","author":"PJ Rousseeuw","year":"2011","unstructured":"Rousseeuw PJ, Hubert M (2011) Robust statistics for outlier detection, Wiley interdisciplinary reviews: Data mining and knowledge discovery, Wiley Online. Library 1(1):73\u201379","journal-title":"Library"},{"issue":"3","key":"4781_CR40","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0167-9473(98)00040-1","volume":"28","author":"S Zani","year":"1998","unstructured":"Zani S, Riani M, Corbellini A (1998) Robust bivariate boxplots and multiple outlier detection. Computational Statistics & Data Analysis 28(3):257\u2013270","journal-title":"Computational Statistics & Data Analysis"},{"key":"4781_CR41","unstructured":"IBM Quest Synthetic Data Generator (2021) https:\/\/sourceforge.net\/projects\/ibmquestdatagen\/ 20 Jun 2021"},{"key":"4781_CR42","unstructured":"Fournier-Viger P (2021) SPMF: An Open-Source Data Mining Library, https:\/\/www.philippe-fournier-viger.com\/spmf\/, 29 Jul 2021"},{"key":"4781_CR43","doi-asserted-by":"crossref","unstructured":"Brin S, Motwani R, Silverstein C (1997) Beyond market baskets: Generalizing association rules to correlations, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p 265\u2013276","DOI":"10.1145\/253262.253327"},{"issue":"1","key":"4781_CR44","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1023\/A:1009713703947","volume":"2","author":"C Silverstein","year":"1998","unstructured":"Silverstein C, Brin S, Motwani R (1998) Beyond market baskets: Generalizing association rules to dependence rules. Data Min Knowl Discov 2(1):39\u201368","journal-title":"Data Min Knowl Discov"},{"key":"4781_CR45","doi-asserted-by":"crossref","unstructured":"Smets K, Vreeken J (2012) Slim: Directly mining descriptive patterns, Proceedings of the SIAM international conference on data mining, p 236\u2013247","DOI":"10.1137\/1.9781611972825.21"},{"issue":"3","key":"4781_CR46","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","volume":"23","author":"T De Bie","year":"2011","unstructured":"De Bie T (2011) Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min Knowl Discov 23(3):407\u2013446","journal-title":"Data Min Knowl Discov"},{"issue":"2","key":"4781_CR47","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TKDE.2011.204","volume":"25","author":"T Guns","year":"2011","unstructured":"Guns T, Nijssen S, De Raedt L (2011) k-Pattern set mining under constraints. IEEE Trans Knowl Data Eng 25(2):402\u2013418","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"4781_CR48","doi-asserted-by":"crossref","unstructured":"Smiti A (2020) A critical overview of outlier detection methods. Comput Sci Rev vol 38 p 100306","DOI":"10.1016\/j.cosrev.2020.100306"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04781-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04781-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04781-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T14:27:03Z","timestamp":1729780023000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04781-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,20]]},"references-count":48,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["4781"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04781-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,20]]},"assertion":[{"value":"10 June 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}},{"value":"The work uses publicly available and synthetically generated datasets which do not have any identifiable information. No ethical approval was needed.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used"}}]}}