{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:02:44Z","timestamp":1725580964755},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198953"},{"type":"electronic","value":"9783642198960"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19896-0_4","type":"book-chapter","created":{"date-parts":[[2011,4,16]],"date-time":"2011-04-16T07:43:17Z","timestamp":1302939797000},"page":"36-49","source":"Crossref","is-referenced-by-count":0,"title":["Secure Top-k Subgroup Discovery"],"prefix":"10.1007","author":[{"given":"Henrik","family":"Grosskreutz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benedikt","family":"Lemmen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"R\u00fcping","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Asuncion, A., Newman, D.: UCI machine learning repository (2007)"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1011429418057","volume":"5","author":"S.D. Bay","year":"2001","unstructured":"Bay, S.D., Pazzani, M.J.: Detecting group differences: Mining contrast sets. Data Min. Knowl. Discov.\u00a05(3), 213\u2013246 (2001)","journal-title":"Data Min. Knowl. Discov."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/253260.253327","volume-title":"SIGMOD Conference","author":"S. Brin","year":"1997","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond market baskets: Generalizing association rules to correlations. In: Peckham, J. (ed.) SIGMOD Conference, pp. 265\u2013276. ACM Press, New York (1997)"},{"key":"4_CR4","unstructured":"Cheung, D., Han, J., Ng, V., Fu, A., Fu, Y.: A fast distributed algorithm for mining association rules. In: International Conference on Parallel and Distributed Information Systems, p. 0031 (1996)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Clifton, C., Kantarcioglu, M., Vaidya, J., Lin, X., Zhu, M.Y.: Tools for privacy preserving distributed data mining. SIGKDD Explor. Newsl.\u00a04(2) (2002)","DOI":"10.1145\/772862.772867"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10994-005-5011-x","volume":"58","author":"J. F\u00fcrnkranz","year":"2005","unstructured":"F\u00fcrnkranz, J., Flach, P.A.: Roc \u2019n\u2019 rule learning-towards a better understanding of covering algorithms. Machine Learning\u00a058(1), 39\u201377 (2005)","journal-title":"Machine Learning"},{"key":"4_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: General Cryptographic Protocols. In: The Foundations of Cryptography, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"key":"4_CR8","volume-title":"ECML\/PKDD (1)","author":"H. Grosskreutz","year":"2008","unstructured":"Grosskreutz, H., R\u00fcping, S., Wrobel, S.: Tight optimistic estimates for fast subgroup discovery. In: ECML\/PKDD (1). Springer, Heidelberg (2008)"},{"key":"4_CR9","first-page":"203","volume-title":"ICDM","author":"W. H\u00e4m\u00e4l\u00e4inen","year":"2008","unstructured":"H\u00e4m\u00e4l\u00e4inen, W., Nyk\u00e4nen, M.: Efficient discovery of statistically significant association rules. In: ICDM, pp. 203\u2013212. IEEE Computer Society, Los Alamitos (2008)"},{"issue":"9","key":"4_CR10","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TKDE.2004.45","volume":"16","author":"M. Kantarcioglu","year":"2004","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving distributed mining of association rules on horizontally partitioned data. IEEE Transactions on Knowledge and Data Engineering\u00a016(9), 1026\u20131037 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Kl\u00f6sgen, W.: Explora: A multipattern and multistrategy discovery assistant. In: Advances in Knowledge Discovery and Data Mining (1996)","DOI":"10.1007\/3-540-61286-6_186"},{"key":"4_CR12","first-page":"153","volume":"5","author":"N. Lavrac","year":"2004","unstructured":"Lavrac, N., Kavsek, B., Flach, P., Todorovski, L.: Subgroup discovery with cn2-sd. Journal of Machine Learning Research\u00a05, 153\u2013188 (2004)","journal-title":"Journal of Machine Learning Research"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, p. 36. Springer, Heidelberg (2000)"},{"key":"4_CR14","unstructured":"Lindell, Y., Pinkas, B.: A proof of yao\u2019s protocol for secure two-party computation. Technical report (2004)"},{"key":"4_CR15","unstructured":"Mielik\u00e4inen, T.: On inverse frequent set mining. In: Workshop on Privacy Preserving Data Mining (2003)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Guns, T., Raedt, L.D.: Correlated itemset mining in roc space: a constraint programming approach. In: KDD, pp. 647\u2013656 (2009)","DOI":"10.1145\/1557019.1557092"},{"key":"4_CR17","unstructured":"Novak, P.K., Lavra\u010d, N., Webb, G.I.: Supervised descriptive rule discovery: A unifying survey of contrast set, emerging pattern and subgroup mining. Journal of Machine Learning Research\u00a010 (2009)"},{"issue":"2","key":"4_CR18","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/772862.772865","volume":"4","author":"B. Pinkas","year":"2002","unstructured":"Pinkas, B.: Cryptographic techniques for privacy-preserving data mining. SIGKDD Explor. Newsl.\u00a04(2), 12\u201319 (2002)","journal-title":"SIGKDD Explor. Newsl."},{"key":"4_CR19","first-page":"761","volume-title":"ICDM","author":"M. Scholz","year":"2005","unstructured":"Scholz, M.: On the tractability of rule discovery from distributed data. In: ICDM, pp. 761\u2013764. IEEE Computer Society, Los Alamitos (2005)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Shaneck, M., Kim, Y., Kumar, V.: Privacy preserving nearest neighbor search. In: ICDM Workshops, pp. 541\u2013545 (2006)","DOI":"10.1109\/ICDMW.2006.133"},{"key":"4_CR21","unstructured":"Shundong, L., Yiqi, D., Daoshun, W., Ping, L.: Symmetric encryption solutions to millionaire\u2019s problem and its extension. In: 1st International Conference on Digital Information Management (2006)"},{"key":"4_CR22","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/1150402.1150451","volume-title":"KDD 2006: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"G.I. Webb","year":"2006","unstructured":"Webb, G.I.: Discovering significant rules. In: KDD 2006: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 434\u2013443. ACM, New York (2006)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-63223-9_108","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"S. Wrobel","year":"1997","unstructured":"Wrobel, S.: An algorithm for multi-relational discovery of subgroups. In: Komorowski, J., Zytkow, J. (eds.) PKDD 1997. LNCS, vol.\u00a01263, pp. 78\u201387. Springer, Heidelberg (1997)"},{"key":"4_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/11871637_40","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"M. Wurst","year":"2006","unstructured":"Wurst, M., Scholz, M.: Distributed subgroup mining. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol.\u00a04213, pp. 421\u2013433. Springer, Heidelberg (2006)"},{"key":"4_CR25","volume-title":"FOCS","author":"A.C.-C. Yao","year":"1982","unstructured":"Yao, A.C.-C.: Protocols for secure computations (extended abstract). In: FOCS. IEEE, Los Alamitos (1982)"},{"key":"4_CR26","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, 1985, pp. 162\u2013167 (October 1986)"}],"container-title":["Lecture Notes in Computer Science","Privacy and Security Issues in Data Mining and Machine Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19896-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T05:58:35Z","timestamp":1712383115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19896-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198953","9783642198960"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19896-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}