{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:06:39Z","timestamp":1742911599189,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030861292"},{"type":"electronic","value":"9783030861308"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86130-8_27","type":"book-chapter","created":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T08:12:16Z","timestamp":1631088736000},"page":"338-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Private Frequent Itemset Mining in the Local Setting"],"prefix":"10.1007","author":[{"given":"Hang","family":"Fu","sequence":"first","affiliation":[]},{"given":"Wei","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Liusheng","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,9]]},"reference":[{"unstructured":"Frequent itemset mining dataset repository. http:\/\/fimi.ua.ac.be\/data\/","key":"27_CR1"},{"doi-asserted-by":"crossref","unstructured":"Adar, E., Weld, D.S., Bershad, B.N., Gribble, S.D.: Why we search: visualizing and predicting user behavior. In: Proceedings of the 16th International Conference on World Wide Web, pp. 161\u2013170 (2007)","key":"27_CR2","DOI":"10.1145\/1242572.1242595"},{"unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of 20th International Conference on Very Large Data Bases, pp. 487\u2013499 (1994)","key":"27_CR3"},{"unstructured":"Alvim, M.S., Chatzikokolakis, K., Palamidessi, C., Pazii, A.: Metric-based local differential privacy for statistical applications. CoRR (2018). http:\/\/arxiv.org\/abs\/1805.01456","key":"27_CR4"},{"doi-asserted-by":"crossref","unstructured":"Andr\u00e9s, M.E., Bordenabe, N.E., Chatzikokolakis, K., Palamidessi, C.: Geo-indistinguishability: differential privacy for location-based systems. In: 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, Berlin, Germany, 4\u20138 November 2013, pp. 901\u2013914 (2013)","key":"27_CR5","DOI":"10.1145\/2508859.2516735"},{"doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: generalizing association rules to correlations. In: SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, pp. 265\u2013276 (1997)","key":"27_CR6","DOI":"10.1145\/253262.253327"},{"unstructured":"Ding, B., Kulkarni, J., Yekhanin, S.: Collecting telemetry data privately. In: Advances in Neural Information Processing Systems, pp. 3571\u20133580 (2017)","key":"27_CR7"},{"issue":"521","key":"27_CR8","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1080\/01621459.2017.1389735","volume":"113","author":"JC Duchi","year":"2018","unstructured":"Duchi, J.C., Jordan, M.I., Wainwright, M.J.: Minimax optimal procedures for locally private estimation. J. Am. Stat. Assoc. 113(521), 182\u2013201 (2018)","journal-title":"J. Am. Stat. Assoc."},{"doi-asserted-by":"crossref","unstructured":"Erlingsson, \u00da., Pihur, V., Korolova, A.: RAPPOR: randomized aggregatable privacy-preserving ordinal response. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 1054\u20131067. ACM (2014)","key":"27_CR9","DOI":"10.1145\/2660267.2660348"},{"issue":"4","key":"27_CR10","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., Kek\u00e4l\u00e4inen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. 20(4), 422\u2013446 (2002)","journal-title":"ACM Trans. Inf. Syst."},{"doi-asserted-by":"crossref","unstructured":"Li, N., Qardaji, W.H., Su, D., Cao, J.: PrivBasis: frequent itemset mining with differential privacy. In: Proceedings of the VLDB Endowment, vol. 5, no. 11, pp. 1340\u20131351 (2012)","key":"27_CR11","DOI":"10.14778\/2350229.2350251"},{"doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 94\u2013103 (2007)","key":"27_CR12","DOI":"10.1109\/FOCS.2007.66"},{"doi-asserted-by":"crossref","unstructured":"Su, S., Xu, S., Cheng, X., Li, Z., Yang, F.: Differentially private frequent itemset mining via transaction splitting. In: 32nd IEEE International Conference on Data Engineering, ICDE 2016, pp. 1564\u20131565 (2016)","key":"27_CR13","DOI":"10.1109\/ICDE.2016.7498427"},{"doi-asserted-by":"crossref","unstructured":"Wang, N., Xiao, X., Yang, Y., Zhang, Z., Gu, Y., Yu, G.: PrivSuper: a superset-first approach to frequent itemset mining under differential privacy. In: 33rd IEEE International Conference on Data Engineering, ICDE 2017, San Diego, CA, USA, 19\u201322 April 2017, pp. 809\u2013820 (2017)","key":"27_CR14","DOI":"10.1109\/ICDE.2017.131"},{"doi-asserted-by":"crossref","unstructured":"Wang, S., Huang, L., Nie, Y., Wang, P., Xu, H., Yang, W.: PrivSet: set-valued data analyses with locale differential privacy. In: 2018 IEEE Conference on Computer Communications, INFOCOM 2018, pp. 1088\u20131096 (2018)","key":"27_CR15","DOI":"10.1109\/INFOCOM.2018.8486234"},{"doi-asserted-by":"crossref","unstructured":"Wang, T., Li, N., Jha, S.: Locally differentially private frequent itemset mining. In: 2018 IEEE Symposium on Security and Privacy, SP 2018, Proceedings, San Francisco, California, USA, 21\u201323 May 2018, pp. 127\u2013143 (2018)","key":"27_CR16","DOI":"10.1109\/SP.2018.00035"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86130-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T08:37:29Z","timestamp":1631090249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86130-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030861292","9783030861308"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86130-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Algorithms, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"315","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":"103","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":"57","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":"33% - 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":"6","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}