{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:58:47Z","timestamp":1725472727742},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540497875"},{"type":"electronic","value":"9783540497882"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11941439_39","type":"book-chapter","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T09:53:05Z","timestamp":1163757185000},"page":"352-361","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Mining of Frequent Itemsets in Distorted Databases"],"prefix":"10.1007","author":[{"given":"Jinlong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Congfu","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proc. ACM-SIGMOD Int. Conference on Management of Data (SIGMOD 2000), pp. 439\u2013450 (2000)","DOI":"10.1145\/342009.335438"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Rizvi, S., Haritsa, J.: Maintaining data privacy in association rule mining. In: Proc. VLDB Int. Conference on Very large data bases (VLDB 2002), pp. 682\u2013693 (2002)","DOI":"10.1016\/B978-155860869-6\/50066-4"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Du, W., Zhan, Z.: Using randomized response techniques for privacy-preserving data mining. In: Proc. ACM-SIGKDD Int. Conference on Knowldge discovery and data mining (SIGKDD 2003), pp. 505\u2013510 (2003)","DOI":"10.1145\/956750.956810"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-24571-1_9","volume-title":"Database Systems for Advanced Applications","author":"S. Agrawal","year":"2004","unstructured":"Agrawal, S., Krishnan, V., Haritsa, J.: On addressing efficiency concerns in privacy-preserving mining. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol.\u00a02973, pp. 113\u2013124. Springer, Heidelberg (2004)"},{"key":"39_CR5","unstructured":"Lin, T.Y.: Granular computing. In: Announcement of the BISC Special Interest Group on Granular Computing (1997)"},{"issue":"2","key":"39_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0165-0114(97)00077-8","volume":"90","author":"L.A. Zadeh","year":"1997","unstructured":"Zadeh, L.A.: Towards a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic. Fuzzy Sets and Systems\u00a090(2), 111\u2013127 (1997)","journal-title":"Fuzzy Sets and Systems"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Yao, Y.Y., Zhong, N.: Granular computing using information tabules. In: Data Mining, Rough Sets and Granular Computing, pp. 102\u2013124. Physica-Verlag (2002)","DOI":"10.1007\/978-3-7908-1791-1_5"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Lin, T.Y., Louie, E.: Data mining using granular computing: fast algorithms for finding association rules. In: Data Mining, Rough Sets and Granular Computing, pp. 23\u201345. Physica-Verlag (2002)","DOI":"10.1007\/978-3-7908-1791-1_2"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-27794-1_1","volume":"I","author":"Z. Pawlak","year":"2004","unstructured":"Pawlak, Z.: Some issues on rough sets. Transactions on Rough Sets\u00a0I, 1\u201358 (2004)","journal-title":"Transactions on Rough Sets"},{"issue":"2","key":"39_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. SIGKDD Explorations\u00a02(2), 66\u201375 (2000)","journal-title":"SIGKDD Explorations"},{"key":"39_CR11","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. VLDB Int. Conference on Very large data bases (VLDB 1994), pp. 487\u2013499 (1994)"},{"key":"39_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/11596448_111","volume-title":"Computational Intelligence and Security","author":"C. Xu","year":"2005","unstructured":"Xu, C., Wang, J., Dan, H., Pan, Y.: An improved EMASK algorithm for privacy-preserving frequent pattern mining. In: Hao, Y., Liu, J., Wang, Y.-P., Cheung, Y.-m., Yin, H., Jiao, L., Ma, J., Jiao, Y.-C. (eds.) CIS 2005. LNCS (LNAI), vol.\u00a03801, pp. 752\u2013757. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","AI 2006: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11941439_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:51:16Z","timestamp":1619509876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11941439_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540497875","9783540497882"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11941439_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}