{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:29:48Z","timestamp":1742912988904,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030260712"},{"type":"electronic","value":"9783030260729"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-26072-9_8","type":"book-chapter","created":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T23:05:48Z","timestamp":1564009548000},"page":"110-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["PrivBUD-Wise: Differentially Private Frequent Itemsets Mining in High-Dimensional Databases"],"prefix":"10.1007","author":[{"given":"Jingxin","family":"Xu","sequence":"first","affiliation":[]},{"given":"Kai","family":"Han","sequence":"additional","affiliation":[]},{"given":"Pingping","family":"Song","sequence":"additional","affiliation":[]},{"given":"Chaoting","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Fei","family":"Gui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,18]]},"reference":[{"key":"8_CR1","unstructured":"http:\/\/fimi.ua.ac.be\/data\/"},{"key":"8_CR2","unstructured":"Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, vol. 1215, pp. 487\u2013499 (1994)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bhaskar, R., Laxman, S., Smith, A., Thakurta, A.: Discovering frequent patterns in sensitive data. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 503\u2013512. ACM (2010)","DOI":"10.1145\/1835804.1835869"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.cose.2014.12.005","volume":"50","author":"X Cheng","year":"2015","unstructured":"Cheng, X., Su, S., Xu, S., Li, Z.: DP-Apriori: a differentially private frequent itemset mining algorithm based on transaction splitting. Comput. Secur. 50, 74\u201390 (2015)","journal-title":"Comput. Secur."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_1"},{"key":"8_CR6","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"},{"issue":"3\u20134","key":"8_CR7","first-page":"211","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A., et al.: The algorithmic foundations of differential privacy. Found. Trends\u00ae Theoret. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","journal-title":"Found. Trends\u00ae Theoret. Comput. Sci."},{"key":"8_CR8","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)","DOI":"10.1145\/2660267.2660348"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Fanaeepour, M., Machanavajjhala, A.: PrivStream: differentially private event detection on data streams. In: Proceedings of the Ninth ACM Conference on Data and Application Security and Privacy, pp. 145\u2013147. ACM (2019)","DOI":"10.1145\/3292006.3302379"},{"issue":"4","key":"8_CR10","first-page":"e1207","volume":"7","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger, P., Lin, J.C.-W., Vo, B., Chi, T.T., Zhang, J., Le, H.B.: A survey of itemset mining. Wiley Interdisc. Rev.: Data Min. Knowl. Discov. 7(4), e1207 (2017)","journal-title":"Wiley Interdisc. Rev.: Data Min. Knowl. Discov."},{"issue":"6","key":"8_CR11","doi-asserted-by":"publisher","first-page":"1673","DOI":"10.1137\/09076828X","volume":"41","author":"A Ghosh","year":"2012","unstructured":"Ghosh, A., Roughgarden, T., Sundararajan, M.: Universally utility-maximizing privacy mechanisms. SIAM J. Comput. 41(6), 1673\u20131693 (2012)","journal-title":"SIAM J. Comput."},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD Rec. 29, 1\u201312 (2000)","journal-title":"ACM SIGMOD Rec."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Lee, J., Clifton, C.W.: Top-k frequent itemsets via differentially private FP-trees. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 931\u2013940. ACM (2014)","DOI":"10.1145\/2623330.2623723"},{"issue":"11","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1340","DOI":"10.14778\/2350229.2350251","volume":"5","author":"N Li","year":"2012","unstructured":"Li, N., Qardaji, W., Su, D., Cao, J.: PrivBasis: frequent itemset mining with differential privacy. Proc. VLDB Endow. 5(11), 1340\u20131351 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.cose.2019.03.008","volume":"84","author":"S Li","year":"2019","unstructured":"Li, S., Mu, N., Le, J., Liao, X.: Privacy preserving frequent itemset mining: maximizing data utility based on database reconstruction. Comput. Secur. 84, 17\u201334 (2019)","journal-title":"Comput. Secur."},{"key":"8_CR16","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: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 809\u2013820. IEEE (2017)","DOI":"10.1109\/ICDE.2017.131"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/2428536.2428539","volume":"6","author":"C Zeng","year":"2012","unstructured":"Zeng, C., Naughton, J.F., Cai, J.-Y.: On differentially private frequent itemset mining. Proc. VLDB Endow. 6(1), 25\u201336 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xiao, X., Xie, X.: PrivTree: a differentially private algorithm for hierarchical decompositions. In: Proceedings of the 2016 International Conference on Management of Data, pp. 155\u2013170. ACM (2016)","DOI":"10.1145\/2882903.2882928"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26072-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:24:58Z","timestamp":1709810698000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26072-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030260712","9783030260729"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26072-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"18 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","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":"1 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cfm.uestc.edu.cn\/apwebwaim2019\/","order":11,"name":"conference_url","label":"Conference URL","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":"Research Microsoft","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","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":"42","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":"17","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":"23% - 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":"5","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)"}}]}}