{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T15:59:15Z","timestamp":1757779155790,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030415785"},{"type":"electronic","value":"9783030415792"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41579-2_38","type":"book-chapter","created":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T16:09:09Z","timestamp":1581955749000},"page":"649-667","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Differentially Private Frequent Itemset Mining Against Incremental Updates"],"prefix":"10.1007","author":[{"given":"Wenjuan","family":"Liang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuncheng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cuiping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,18]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Calandrino, J.A., et al.: You might also like: privacy risks of collaborative filtering. In: IEEE Symposium on Security and Privacy, pp. 231\u2013246 (2011)","DOI":"10.1109\/SP.2011.40"},{"issue":"1","key":"38_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s41019-015-0001-x","volume":"1","author":"J Soria-Comas","year":"2016","unstructured":"Soria-Comas, J., Domingo-Ferrer, J.: Big data privacy: challenges to privacy principles and models. Data Sci. Eng. 1(1), 25\u201336 (2016)","journal-title":"Data Sci. Eng."},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: FOCS, pp. 94\u2013103 (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Su, S., Xu, S., et al.: Differentially private frequent itemset mining via transaction splitting. In: ICDE, pp. 1564\u20131565 (2016)","DOI":"10.1109\/ICDE.2016.7498427"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Wang, N., et al.: PrivSuper: a superset-first approach to frequent itemset mining under differential privacy. In: ICDE, pp. 809\u2013820 (2017)","DOI":"10.1109\/ICDE.2017.131"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"Bhaskar, R., Laxman, S., Smith, A., Thakurta, A.: Discovering frequent patterns in sensitive data. In: KDD, pp. 503\u2013512 (2010)","DOI":"10.1145\/1835804.1835869"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Zeng, C., Naughton, J.F., et al.: On differentially private frequent itemset mining. In: PVLDB, vol. 6, no. 1, pp. 25\u201336 (2012)","DOI":"10.14778\/2428536.2428539"},{"key":"38_CR9","unstructured":"Leung, C.K.-S., et al.: CanTree: a tree structure for efficient incremental mining of frequent patterns. In: ICDM, pp. 274\u2013281 (2005)"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Li, N., Qardaji, W.H., et al.: PrivBasis: frequent itemset mining with differential privacy. In: PVLDB, vol. 5, no. 11, pp. 1340\u20131351 (2012)","DOI":"10.14778\/2350229.2350251"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Jin, R., McCallen, S.: Estimating the number of frequent itemsets in a large database. In: EDBT, pp. 505\u2013516 (2009)","DOI":"10.1145\/1516360.1516420"},{"key":"38_CR12","unstructured":"UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"key":"38_CR13","unstructured":"Frequent itemset mining dataset repository. http:\/\/fimi.ua.ac.be\/data"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Dwork, C.: Differential privacy in new settings. In: SODA, pp. 174\u2013183 (2010)","DOI":"10.1137\/1.9781611973075.16"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Pitassi, T., Rothblum, G.N.: Differential privacy under continual observation. In: STOC, pp. 715\u2013724 (2010)","DOI":"10.1145\/1806689.1806787"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-642-14162-1_34","volume-title":"Automata, Languages and Programming","author":"T-H Hubert Chan","year":"2010","unstructured":"Hubert Chan, T.-H., Shi, E., Song, D.: Private and continual release of statistics. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 405\u2013417. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_34"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Chen, Y., Machanavajjhala, A., et al.: PeGaSus: data-adaptive differentially private stream processing. In: CCS, pp. 1375\u20131388 (2017)","DOI":"10.1145\/3133956.3134102"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Chen, R., Shen, Y., Jin, H.: Private analysis of infinite data streams via retroactive grouping. In: CIKM, pp. 1061\u20131070 (2015)","DOI":"10.1145\/2806416.2806454"},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"Fan, L., Xiong, L., et al.: FAST: differentially private real-time aggregate monitor with filtering and adaptive sampling. In: SIGMOD, pp. 1065\u20131068 (2013)","DOI":"10.1145\/2463676.2465253"},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Fan, L., Xiong, L.: An adaptive approach to real-time aggregate monitoring with differential privacy. In: TKDE, vol. 26, no. 9, pp. 2094\u20132106 (2014)","DOI":"10.1109\/TKDE.2013.96"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"Li, H., Xiong, L., et al.: Differentially private histogram publication for dynamic datasets: an adaptive sampling approach. In: CIKM, pp. 1001\u20131010 (2015)","DOI":"10.1145\/2806416.2806441"},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"Kellaris, G., Papadopoulos, S., et al.: Differentially private event sequences over infinite streams. In: PVLDB, vol. 7, no. 12, pp. 1155\u20131166 (2014)","DOI":"10.14778\/2732977.2732989"},{"key":"38_CR23","doi-asserted-by":"crossref","unstructured":"Bolot, J., Fawaz, N., Muthukrishnan, S., Nikolov, A., Taft, N.: Private decayed predicate sums on streams. In: ICDT, pp. 284\u2013295 (2013)","DOI":"10.1145\/2448496.2448530"},{"key":"38_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/978-3-662-48800-3_30","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"C Dwork","year":"2015","unstructured":"Dwork, C., Naor, M., Reingold, O., Rothblum, G.N.: Pure differential privacy for rectangle queries via private partitions. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9453, pp. 735\u2013751. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48800-3_30"},{"key":"38_CR25","doi-asserted-by":"crossref","unstructured":"Cao, Y., Yoshikawa, M., et al.: Quantifying differential privacy under temporal correlations. In: ICDE, pp. 821\u2013832 (2017)","DOI":"10.1109\/ICDE.2017.132"},{"key":"38_CR26","doi-asserted-by":"crossref","unstructured":"Wang, T., Li, N., Jha, S.: Locally differentially private frequent itemset mining. In: IEEE Symposium on Security and Privacy, pp. 127\u2013143 (2018)","DOI":"10.1109\/SP.2018.00035"},{"key":"38_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-030-26072-9_8","volume-title":"Web and Big Data","author":"J Xu","year":"2019","unstructured":"Xu, J., Han, K., Song, P., Xu, C., Gui, F.: PrivBUD-wise: differentially private frequent itemsets mining in high-dimensional databases. In: Shao, J., Yiu, M.L., Toyoda, M., Zhang, D., Wang, W., Cui, B. (eds.) APWeb-WAIM 2019. LNCS, vol. 11641, pp. 110\u2013124. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26072-9_8"},{"key":"38_CR28","doi-asserted-by":"publisher","first-page":"28877","DOI":"10.1109\/ACCESS.2018.2839752","volume":"6","author":"X Xiong","year":"2018","unstructured":"Xiong, X., Chen, F.: Frequent itemsets mining with differential privacy over large-scale data. IEEE Access 6, 28877\u201328889 (2018)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41579-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T20:31:20Z","timestamp":1606422680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41579-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030415785","9783030415792"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41579-2_38","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":"18 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"15 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icics2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"199","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":"47","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":"24% - 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":"3","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":"8","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)"}}]}}