{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:21:17Z","timestamp":1743146477157,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319018560"},{"type":"electronic","value":"9783319018577"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-01857-7_15","type":"book-chapter","created":{"date-parts":[[2013,8,7]],"date-time":"2013-08-07T07:47:00Z","timestamp":1375861620000},"page":"151-161","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for Sequential Pattern Mining with Privacy Preservation"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Gorawski","sequence":"first","affiliation":[]},{"given":"Pawel","family":"Jureczek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy preserving association rule mining in vertically partitioned data. In: KDD, pp. 639\u2013644 (2002)","DOI":"10.1145\/775047.775142"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for Privacy Preserving Data Mining. SIGKDD Explorations, 28\u201334 (2002)","DOI":"10.1145\/772862.772867"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data. In: DMKD, pp. 1026\u20131037 (2002)","DOI":"10.1109\/TKDE.2004.45"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Gorawski, M., Siedlecki, Z.: Optimization of Privacy Preserving Mechanisms in Homogeneous Collaborative Association Rules Mining. In: ARES, pp. 347\u2013352 (2011)","DOI":"10.1007\/978-3-642-25109-2_23"},{"key":"15_CR6","series-title":"AISC","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/978-3-319-00945-2_16","volume-title":"New Results in Dependability and Computer Systems","author":"M. Gorawski","year":"2013","unstructured":"Gorawski, M., Jureczek, P.: Optimization of privacy preserving mechanisms in mining continuous patterns. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds.) New Results in Dependability & Comput. Syst. AISC, vol.\u00a0224, pp. 183\u2013194. Springer, Heidelberg (2013)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/978-3-642-23878-9_24","volume-title":"Intelligent Data Engineering and Automated Learning - IDEAL 2011","author":"M. Gorawski","year":"2011","unstructured":"Gorawski, M., Jureczek, P.: Extensions for Continuous Pattern Mining. In: Yin, H., Wang, W., Rayward-Smith, V. (eds.) IDEAL 2011. LNCS, vol.\u00a06936, pp. 194\u2013203. Springer, Heidelberg (2011)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-642-13769-3_23","volume-title":"Hybrid Artificial Intelligence Systems","author":"M. Gorawski","year":"2010","unstructured":"Gorawski, M., Jureczek, P.: Continuous Pattern Mining Using the FCPGrowth Algorithm in Trajectory Data Warehouses. In: Gra\u00f1a Romay, M., Corchado, E., Garcia Sebastian, M.T. (eds.) HAIS 2010, Part I. LNCS, vol.\u00a06076, pp. 187\u2013195. Springer, Heidelberg (2010)"},{"key":"15_CR9","unstructured":"Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: ICDE, pp. 3\u201314 (1995)"},{"key":"15_CR10","unstructured":"Qu, M.: Standards for efficient cryptography sec 2: Recommended elliptic curve domain parameters (2010)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/978-3-642-12145-6_8","volume-title":"Intelligent Information and Database Systems","author":"M. Gorawski","year":"2010","unstructured":"Gorawski, M., Jureczek, P.: Regions of Interest in Trajectory Data Warehouse. In: Nguyen, N.T., Le, M.T., \u015awi\u0105tek, J. (eds.) ACIIDS 2010, Part I. LNCS, vol.\u00a05990, pp. 74\u201381. Springer, Heidelberg (2010)"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Systems Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-01857-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T20:49:27Z","timestamp":1676580567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-01857-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319018560","9783319018577"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-01857-7_15","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}