{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:11Z","timestamp":1742912411260,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030600280"},{"type":"electronic","value":"9783030600297"}],"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-60029-7_49","type":"book-chapter","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T23:07:40Z","timestamp":1600729660000},"page":"547-558","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Top-k Frequent Itemsets Publication of Uncertain Data Based on Differential Privacy"],"prefix":"10.1007","author":[{"given":"Yunfeng","family":"Zou","sequence":"first","affiliation":[]},{"given":"Xiaohan","family":"Bao","sequence":"additional","affiliation":[]},{"given":"Chao","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Weiwei","family":"Ni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","unstructured":"Tong, Y., et al.: Mining frequent itemsets over uncertain databases. Proc. VLDB Endow. 5(11), 1650\u20131661 (2012). https:\/\/doi.org\/10.14778\/2350229.2350277","DOI":"10.14778\/2350229.2350277"},{"key":"49_CR2","doi-asserted-by":"publisher","unstructured":"Leung, C.K.-S., et al.: Privacy-preserving frequent pattern mining from big uncertain data. In: 2018 IEEE International Conference on Big Data (Big Data) (2018). https:\/\/doi.org\/10.1109\/BigData.2018.8622260","DOI":"10.1109\/BigData.2018.8622260"},{"key":"49_CR3","doi-asserted-by":"publisher","unstructured":"Ding, Z., et al.: Frequent itemsets mining for uncertain data based on differential privacy. Appl. Res. Comput. 35(321.07), 28\u201332 (2018). (Chinese). https:\/\/doi.org\/10.3969\/j.issn.1001-3695.2018.07.004","DOI":"10.3969\/j.issn.1001-3695.2018.07.004"},{"key":"49_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-71701-0_8","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C-K Chui","year":"2007","unstructured":"Chui, C.-K., Kao, B., Hung, E.: Mining frequent itemsets from uncertain data. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 47\u201358. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71701-0_8"},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-540-68125-0_61","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"CKS Leung","year":"2008","unstructured":"Leung, C.K.S., Mateo, M.A.F., Brajczuk, D.A.: A tree-based approach for frequent pattern mining from uncertain data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 653\u2013661. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68125-0_61"},{"key":"49_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-29038-1_21","volume-title":"Database Systems for Advanced Applications","author":"CKS Leung","year":"2012","unstructured":"Leung, C.K.S., Tanbeer, S.K.: Fast tree-based mining of frequent itemsets from uncertain data. In: Lee, S., Peng, Z., Zhou, X., Moon, Y.S., Unland, R., Yoo, J. (eds.) DASFAA 2012. LNCS, vol. 7238, pp. 272\u2013287. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29038-1_21"},{"key":"49_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-37453-1_2","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"CKS Leung","year":"2013","unstructured":"Leung, C.K.S., Tanbeer, S.K.: PUF-tree: a compact tree structure for frequent pattern mining of uncertain data. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013. LNCS (LNAI), vol. 7818, pp. 13\u201325. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37453-1_2"},{"key":"49_CR8","doi-asserted-by":"publisher","unstructured":"Dwork, C.: A firm foundation for private data analysis. Commun. ACM 54(1), 86\u201395 (2011). https:\/\/doi.org\/10.1145\/1866739.1866758","DOI":"10.1145\/1866739.1866758"},{"key":"49_CR9","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":"49_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","volume-title":"Theory and Applications of Models of Computation","author":"C Dwork","year":"2008","unstructured":"Dwork, C.: Differential privacy: a survey of results. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 1\u201319. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79228-4_1"},{"key":"49_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-030-02934-0_27","volume-title":"Web Information Systems and Applications","author":"J Wu","year":"2018","unstructured":"Wu, J., Ni, W., Zhang, S.: Generalization based privacy-preserving provenance publishing. In: Meng, X., Li, R., Wang, K., Niu, B., Wang, X., Zhao, G. (eds.) WISA 2018. LNCS, vol. 11242, pp. 287\u2013299. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02934-0_27"},{"key":"49_CR12","doi-asserted-by":"publisher","unstructured":"Lyu, M., Su, D., Li, N.: Understanding the sparse vector technique for differential privacy. Proc. VLDB Endow. 10(6), 637\u2013648 (2017). https:\/\/doi.org\/10.14778\/3055330.3055331","DOI":"10.14778\/3055330.3055331"},{"key":"49_CR13","doi-asserted-by":"publisher","unstructured":"Zhang, X., et al.: An accurate method for mining top-k frequent pattern under differential privacy. J. Integr. Plant Biol. 51(1), 104\u2013114 (2014). (Chinese). https:\/\/doi.org\/10.7544\/issn1000-1239.2014.20130685","DOI":"10.7544\/issn1000-1239.2014.20130685"},{"key":"49_CR14","unstructured":"Gan, W., et al.: Frequent pattern mining with differential privacy based on transaction truncation. J. Chin. Comput. Syst. 36(11), 2583\u20132587 (2015). (Chinese)"},{"issue":"5","key":"49_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-018-9849-y","volume":"63","author":"W Liang","year":"2020","unstructured":"Liang, W., Chen, H., Zhang, J., Zhao, D., Li, C.: An effective scheme for top-k frequent itemset mining under differential privacy conditions. Sci. China Inf. Sci. 63(5), 1\u20133 (2020). https:\/\/doi.org\/10.1007\/s11432-018-9849-y","journal-title":"Sci. China Inf. Sci."},{"key":"49_CR16","doi-asserted-by":"publisher","unstructured":"Xiong, X., et al.: Frequent itemsets mining with differential privacy over large-scale data. IEEE Access 6, 2887 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2018.2839752","DOI":"10.1109\/ACCESS.2018.2839752"}],"container-title":["Lecture Notes in Computer Science","Web Information Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60029-7_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:45:40Z","timestamp":1709811940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60029-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030600280","9783030600297"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60029-7_49","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":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WISA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web Information Systems and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wisa22020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wisa.pmease.cn\/wisa2020\/index.html","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":"CCF Consys","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"165","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":"16","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":"25% - 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.6","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":"7.2","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)"}}]}}