{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T22:40:10Z","timestamp":1747089610323,"version":"3.40.5"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030488604"},{"type":"electronic","value":"9783030488611"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48861-1_2","type":"book-chapter","created":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T14:17:30Z","timestamp":1589379450000},"page":"21-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Heuristic Approach for Sensitive Pattern Hiding with Improved Data\u00a0Quality"],"prefix":"10.1007","author":[{"given":"Shalini","family":"Jangra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Durga","family":"Toshniowal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,14]]},"reference":[{"key":"2_CR1","series-title":"Advances in Database Systems","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-0-387-70992-5_2","volume-title":"Privacy-Preserving Data Mining","author":"CC Aggarwal","year":"2008","unstructured":"Aggarwal, C.C., Philip, S.Y.: A general survey of privacy-preserving data mining models and algorithms. In: Aggarwal, C.C., Yu, P.S. (eds.) Privacy-Preserving Data Mining. ADBS, vol. 34, pp. 11\u201352. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-70992-5_2"},{"key":"2_CR2","unstructured":"Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference Very Large Databases VLDB, vol. 1215, pp. 487\u2013499 (1994)"},{"issue":"1","key":"2_CR3","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.: Dare to share: protecting sensitive knowledge with data sanitization. Decis. Support Syst. 43(1), 181\u2013191 (2007)","journal-title":"Decis. Support Syst."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., Verykios, V.: Disclosure limitation of sensitive rules. In: Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX 1999) (Cat. No. PR00453), pp. 45\u201352. IEEE (1999)","DOI":"10.1109\/KDEX.1999.836532"},{"issue":"2","key":"2_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10489-015-0671-0","volume":"44","author":"P Cheng","year":"2015","unstructured":"Cheng, P., Roddick, J.F., Chu, S.-C., Lin, C.-W.: Privacy preservation through a greedy, distortion-based rule-hiding method. Appl. Intell. 44(2), 295\u2013306 (2015). https:\/\/doi.org\/10.1007\/s10489-015-0671-0","journal-title":"Appl. Intell."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Dai, B.R., Chiang, L.H.: Hiding frequent patterns in the updated database. In: 2010 International Conference on Information Science and Applications, pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/ICISA.2010.5480385"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Gkoulalas-Divanis, A., Verykios, V.S.: An integer programming approach for frequent itemset hiding. In: Proceedings of the 15th ACM International Conference on Information and Knowledge Management, pp. 748\u2013757. ACM (2006)","DOI":"10.1145\/1183614.1183721"},{"issue":"5","key":"2_CR8","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, V.S.: Exact knowledge hiding through database extension. IEEE Trans. Knowl. Data Eng. 21(5), 699\u2013713 (2008)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR9","unstructured":"Jadav, K.B., Vania, J., Patel, D.: Efficient hiding of sensitive association rules for incremental datasets. Int. J. Innov. Adv. Comput. Sci. (IJIACS) (2014)"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/380995.381033","volume":"2","author":"R Kohavi","year":"2000","unstructured":"Kohavi, R., Brodley, C.E., Frasca, B., Mason, L., Zheng, Z.: KDD-cup 2000 organizers\u2019 report: peeling the onion. SIGKDD Explor. 2(2), 86\u201398 (2000)","journal-title":"SIGKDD Explor."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Lin, C.W., Hong, T.P., Hsu, H.C.: Reducing side effects of hiding sensitive itemsets in privacy preserving data mining. Sci. World J. 2014 (2014)","DOI":"10.1155\/2014\/235837"},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10489-014-0590-5","volume":"42","author":"CW Lin","year":"2015","unstructured":"Lin, C.W., Hong, T.P., Yang, K.T., Wang, S.L.: The GA-based algorithms for optimizing hiding sensitive itemsets through transaction deletion. Appl. Intell. 42(2), 210\u2013230 (2015)","journal-title":"Appl. Intell."},{"key":"2_CR13","first-page":"13","volume":"2014","author":"CW Lin","year":"2014","unstructured":"Lin, C.W., Zhang, B., Yang, K.T., Hong, T.P.: Efficiently hiding sensitive itemsets with transaction deletion based on genetic algorithms. Sci. World J. 2014, 13 (2014)","journal-title":"Sci. World J."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2016.03.007","volume":"53","author":"JCW Lin","year":"2016","unstructured":"Lin, J.C.W., Liu, Q., Fournier-Viger, P., Hong, T.P., Voznak, M., Zhan, J.: A sanitization approach for hiding sensitive itemsets based on particle swarm optimization. Eng. Appl. Artif. Intell. 53, 1\u201318 (2016)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.datak.2007.06.012","volume":"65","author":"GV Moustakides","year":"2008","unstructured":"Moustakides, G.V., Verykios, V.S.: A maxmin approach for hiding frequent itemsets. Data Knowl. Eng. 65(1), 75\u201389 (2008)","journal-title":"Data Knowl. Eng."},{"key":"2_CR16","unstructured":"Oliveira, S.R., Zaiane, O.R.: Privacy preserving frequent itemset mining. In: Proceedings of the IEEE International Conference on Privacy, Security and Data Mining, vol. 14, pp. 43\u201354. Australian Computer Society, Inc. (2002)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Oliveira, S.R., Za\u00efane, O.R.: Protecting sensitive knowledge by data sanitization. In: Third IEEE International Conference on Data Mining, pp. 613\u2013616. IEEE (2003)","DOI":"10.1109\/ICDM.2003.1250990"},{"issue":"2","key":"2_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.4018\/IJDWM.2018040103","volume":"14","author":"AC \u00d6zt\u00fcrk","year":"2018","unstructured":"\u00d6zt\u00fcrk, A.C., Ergen\u00e7, B.: Dynamic itemset hiding algorithm for multiple sensitive support thresholds. Int. J. Data Warehous. Min. (IJDWM) 14(2), 37\u201359 (2018)","journal-title":"Int. J. Data Warehous. Min. (IJDWM)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Pontikakis, E.D., Theodoridis, Y., Tsitsonis, A.A., Chang, L., Verykios, V.S.: A quantitative and qualitative analysis of blocking in association rule hiding. In: Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, pp. 29\u201330. ACM (2004)","DOI":"10.1145\/1029179.1029187"},{"issue":"4","key":"2_CR20","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/604264.604271","volume":"30","author":"Y Saygin","year":"2001","unstructured":"Saygin, Y., Verykios, V.S., Clifton, C.: Using unknowns to prevent discovery of association rules. ACM Sigmod Record 30(4), 45\u201354 (2001)","journal-title":"ACM Sigmod Record"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Saygin, Y., Verykios, V.S., Elmagarmid, A.K.: Privacy preserving association rule mining. In: Proceedings Twelfth International Workshop on Research Issues in Data Engineering: Engineering E-Commerce\/E-Business Systems RIDE-2EC 2002, pp. 151\u2013158. IEEE (2002)","DOI":"10.1109\/RIDE.2002.995109"},{"key":"2_CR22","unstructured":"Sharma, S., Toshniwal, D.: MR-I MaxMin-scalable two-phase border based knowledge hiding technique using MapReduce. Future Gener. Comput. Syst. (2018)"},{"issue":"1","key":"2_CR23","doi-asserted-by":"publisher","first-page":"74","DOI":"10.5626\/JCSE.2007.1.1.074","volume":"1","author":"X Sun","year":"2007","unstructured":"Sun, X., Yu, P.S.: Hiding sensitive frequent itemsets by a border-based approach. J. Comput. Sci. Eng. 1(1), 74\u201394 (2007)","journal-title":"J. Comput. Sci. Eng."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Wang, S.L., Jafari, A.: Using unknowns for hiding sensitive predictive association rules. In: IRI-2005 IEEE International Conference on Information Reuse and Integration 2005, pp. 223\u2013228. IEEE (2005)","DOI":"10.1109\/IRI-05.2005.1506477"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"10024","DOI":"10.1109\/ACCESS.2017.2702281","volume":"5","author":"JMT Wu","year":"2017","unstructured":"Wu, J.M.T., Zhan, J., Lin, J.C.W.: Ant colony system sanitization approach to hiding sensitive itemsets. IEEE Access 5, 10024\u201310039 (2017)","journal-title":"IEEE Access"},{"issue":"4","key":"2_CR26","doi-asserted-by":"publisher","first-page":"279","DOI":"10.20532\/cit.2017.1003680","volume":"25","author":"F Zamani Boroujeni","year":"2017","unstructured":"Zamani Boroujeni, F., Hossein Afshari, D.: An efficient rule-hiding method for privacy preserving in transactional databases. J. Comput. Inf. Technol. 25(4), 279\u2013290 (2017)","journal-title":"J. Comput. Inf. Technol."}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Mining Complex Patterns"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48861-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T22:02:53Z","timestamp":1747087373000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48861-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030488604","9783030488611"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48861-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFMCP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on New Frontiers in Mining Complex Patterns","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfmcp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.di.uniba.it\/~loglisci\/NFMCP2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}