{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:53:39Z","timestamp":1725512019216},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540717027"},{"type":"electronic","value":"9783540717034"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71703-4_21","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T00:31:22Z","timestamp":1186014682000},"page":"225-236","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-Preserving Frequent Pattern Sharing"],"prefix":"10.1007","author":[{"given":"Zhihui","family":"Wang","sequence":"first","affiliation":[]},{"given":"Wei","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Baile","family":"Shi","sequence":"additional","affiliation":[]},{"given":"S. H.","family":"Boey","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Calders, T.: Computational complexity of itemset frequency satisfiability. In: PODS, Paris, France, June 2004, pp. 143\u2013154 (2004)","DOI":"10.1145\/1055558.1055580"},{"key":"21_CR2","unstructured":"Mielikainen, T.: On inverse frequent set mining. In: Workshop on Privacy Preserving Data Mining, November 2003, pp. 18\u201323 (2003)"},{"key":"21_CR3","first-page":"15","volume-title":"ACM SIGMOD Workshop on Data Mining and Knowledge Discovery","author":"C. Clifton","year":"1996","unstructured":"Clifton, C., Marks, D.: Security and privacy implications of data mining. In: ACM SIGMOD Workshop on Data Mining and Knowledge Discovery, Montreal, Canada, pp. 15\u201319. ACM Press, New York (1996)"},{"key":"21_CR4","volume-title":"Data Mining: Concept and Techniques","author":"J. Han","year":"2000","unstructured":"Han, J., Kamber, M.: Data Mining: Concept and Techniques. Morgan Kaufmann Publishers, San Francisco (2000)"},{"key":"21_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"21_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-540-24775-3_10","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S.R.M. Oliveira","year":"2004","unstructured":"Oliveira, S.R.M., Za\u00efane, O.R., Sayg\u0131n, Y.: Secure Association Rule Sharing. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol.\u00a03056, pp. 74\u201385. Springer, Heidelberg (2004)"},{"key":"21_CR7","first-page":"530","volume-title":"IEEE ICDM Workshop on Privacy Aspects of Data Mining","author":"Z. Wang","year":"2006","unstructured":"Wang, Z., Wang, W., Shi, B., Boey, S.H.: Preserving private knowledge in frequent pattern mining. In: IEEE ICDM Workshop on Privacy Aspects of Data Mining, Hong Kong, China, pp. 530\u2013534. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"21_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/11564126_7","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"M. Atzori","year":"2005","unstructured":"Atzori, M., Bonchi, F., Giannotti, F., Pedreschi, D.: k-Anonymous Patterns. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, pp. 10\u201321. Springer, Heidelberg (2005)"},{"key":"21_CR9","first-page":"45","volume-title":"IEEE Knowledge and Data Engineering Exchange Workshop","author":"M. Atallah","year":"1999","unstructured":"Atallah, M., Bertino, E., Elmagarmid, A., Ibrahim, M., Verykios, V.: Disclosure limitation of sensitive rules. In: IEEE Knowledge and Data Engineering Exchange Workshop, Chicago, IL, pp. 45\u201352. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Oliveira, S.R.M., Za\u00efane, O.R.: Algorithms for balancing privacy and knowledge discovery in association rule mining. In: IDEAS, Hong Kong, China, pp. 54\u201365 (2003)","DOI":"10.1109\/IDEAS.2003.1214911"},{"issue":"4","key":"21_CR11","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. SIGMOD Record\u00a030(4), 45\u201354 (2001)","journal-title":"SIGMOD Record"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11775300_13","volume-title":"Advances in Web-Age Information Management","author":"Z. Wang","year":"2006","unstructured":"Wang, Z., Liu, B., Wang, W., Zhou, H., Shi, B.-L.: An Effective Approach for Hiding Sensitive Knowledge in Data Publishing. In: Yu, J.X., Kitsuregawa, M., Leong, H.-V. (eds.) WAIM 2006. LNCS, vol.\u00a04016, pp. 146\u2013157. Springer, Heidelberg (2006)"},{"key":"21_CR13","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, Santiago, Chile, pp. 487\u2013499 (1994)"}],"container-title":["Lecture Notes in Computer Science","Advances in Databases: Concepts, Systems and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71703-4_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:54:32Z","timestamp":1619517272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71703-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540717027","9783540717034"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71703-4_21","relation":{},"subject":[]}}