{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:05:08Z","timestamp":1725750308027},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642409349"},{"type":"electronic","value":"9783642409356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40935-6_18","type":"book-chapter","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T05:14:50Z","timestamp":1380258890000},"page":"249-263","source":"Crossref","is-referenced-by-count":0,"title":["Differentially-Private Learning of Low Dimensional Manifolds"],"prefix":"10.1007","author":[{"given":"Anna","family":"Choromanska","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Choromanski","sequence":"additional","affiliation":[]},{"given":"Geetha","family":"Jagannathan","sequence":"additional","affiliation":[]},{"given":"Claire","family":"Monteleoni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1145\/76894.76895","volume":"21","author":"N.R. Adam","year":"1989","unstructured":"Adam, N.R., Worthmann, J.C.: Security-control methods for statistical databases: A comparative study. ACM Comput. Surv.\u00a021(4), 515\u2013556 (1989)","journal-title":"ACM Comput. Surv."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: SIGMOID 2000, vol.\u00a029, pp. 439\u2013450 (2000)","DOI":"10.1145\/335191.335438"},{"key":"18_CR3","unstructured":"Bishop, C.: Pattern Recognition and Machine learning. Springer (2006)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: The SuLQ framework. In: PODS 2005, pp. 128\u2013138 (2005)","DOI":"10.1145\/1065167.1065184"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: STOC 2008, pp. 609\u2013618 (2008)","DOI":"10.1145\/1374376.1374464"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Brickell, J., Shmatikov, V.: The cost of privacy: Destruction of data-mining utility in anonymized data publishing. In: KDD 2008, pp. 70\u201378 (2008)","DOI":"10.1145\/1401890.1401904"},{"key":"18_CR7","first-page":"155","volume":"19","author":"K. Chaudhuri","year":"2011","unstructured":"Chaudhuri, K., Hsu, D.: Sample complexity bounds for differentially private learning. Journal of Machine Learning Research\u00a019, 155\u2013186 (2011)","journal-title":"Journal of Machine Learning Research"},{"key":"18_CR8","first-page":"1069","volume":"12","author":"K. Chaudhuri","year":"2011","unstructured":"Chaudhuri, K., Monteleoni, C., Sarwate, A.: Differentially private empirical risk minimization. Journal of Machine Learning Research\u00a012, 1069\u20131109 (2011)","journal-title":"Journal of Machine Learning Research"},{"key":"18_CR9","unstructured":"Chaudhuri, K., Sarwate, A.D., Sinha, K.: Near-optimal algorithms for differentially-private principal components. CoRR, abs\/1207.2812 (2012)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Cormode, G., Procopiuc, C.M., Srivastava, D., Tran, T.T.L.: Differentially private publication of sparse data. CoRR, abs\/1103.0825 (2011)","DOI":"10.1145\/2274576.2274608"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Cormode, G., Procopiuc, M., Shen, E., Srivastava, D., Yu, T.: Differentially private spatial decompositions. In: ICDE, pp. 20\u201331 (2012)","DOI":"10.1109\/ICDE.2012.16"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Cox, T., Cox, M.: Multidimensional Scaling. Chapman and Hall (2000)","DOI":"10.1201\/9781420036121"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Freund, Y.: Random projection trees and low dimensional manifolds. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, STOC 2008, pp. 537\u2013546 (2008)","DOI":"10.1145\/1374376.1374452"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Dwork, C.: Differential privacy: A survey of results. In: 5th International Conference on TAMC: Theory and Applications of Models of Computation, pp. 1\u201319 (2008)","DOI":"10.1007\/978-3-540-79228-4_1"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-00457-5_29","volume-title":"Theory of Cryptography","author":"C. Dwork","year":"2009","unstructured":"Dwork, C.: The differential privacy frontier (extended abstract). In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 496\u2013502. Springer, Heidelberg (2009)"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Dwork, C.: Differential privacy in new settings. In: SODA, pp. 174\u2013183 (2010)","DOI":"10.1137\/1.9781611973075.16"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1866739.1866758","volume":"54","author":"C. Dwork","year":"2011","unstructured":"Dwork, C.: A firm foundation for private data analysis. Commun. ACM\u00a054(1), 86\u201395 (2011)","journal-title":"Commun. ACM"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Dwork, C., Lei, J.: Differential privacy and robust statistics. In: STOC 2009, pp. 371\u2013380 (2009)","DOI":"10.1145\/1536414.1536466"},{"key":"18_CR19","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.\u00a03876, pp. 265\u2013284. Springer, Heidelberg (2006)"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Feldman, D., Fiat, A., Kaplan, H., Nissim, K.: Private coresets. In: STOC 2009, pp. 361\u2013370 (2009)","DOI":"10.1145\/1536414.1536465"},{"key":"18_CR21","unstructured":"Freund, Y., Dasgupta, S., Kabra, M., Verma, N.: Learning the structure of manifolds using random projections. In: NIPS (2007)"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Friedman, A., Schuster, A.: Data mining with differential privacy. In: KDD, pp. 493\u2013502 (2010)","DOI":"10.1145\/1835804.1835868"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Ganta, S., Kasiviswanathan, S., Smith, A.: Composition attacks and auxiliary information in data privacy. In: KDD 2008 (2008)","DOI":"10.1145\/1401890.1401926"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, vol. II. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Jagannathan, G., Pillaipakkamnatt, K., Wright, R.N.: A practical differentially private random decision tree classifier. In: ICDMW 2009: Proceedings of the 2009 ICDM Workshops, pp. 114\u2013121 (2009)","DOI":"10.1109\/ICDMW.2009.93"},{"key":"18_CR26","first-page":"1","volume":"23","author":"P. Jain","year":"2012","unstructured":"Jain, P., Kothari, P., Thakurta, A.: Differentially private online learning. Journal of Machine Learning Research - Proceedings Track\u00a023, 24.1\u201324.34 (2012)","journal-title":"Journal of Machine Learning Research - Proceedings Track"},{"key":"18_CR27","unstructured":"Jain, P., Thakurta, A.: Differentially private learning with kernels. ICML (to appear, 2013)"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Kapralov, M., Talwar, K.: On differentially private low rank approximation. In: SODA, pp. 1395\u20131414 (2013)","DOI":"10.1137\/1.9781611973105.101"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Kasiviswanathan, S., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.: What can we learn privately? In: FOCS 2008: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 531\u2013540 (2008)","DOI":"10.1109\/FOCS.2008.27"},{"key":"18_CR30","unstructured":"Kpotufe, S.: Escaping the curse of dimensionality with a tree-based regressor. In: COLT (2009)"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Lee, J.A., Verleysen, M.: Nonlinear Dimensionality Reduction. Springer (2007)","DOI":"10.1007\/978-0-387-39351-3"},{"issue":"3","key":"18_CR32","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s00145-001-0019-2","volume":"15","author":"Y. Lindell","year":"2002","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. J. Cryptology\u00a015(3), 177\u2013206 (2002)","journal-title":"J. Cryptology"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: FOCS 2007: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, pp. 94\u2013103 (2007)","DOI":"10.1109\/FOCS.2007.4389483"},{"key":"18_CR34","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/1250790.1250803","volume-title":"STOC 2007: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing","author":"K. Nissim","year":"2007","unstructured":"Nissim, K., Raskhodnikova, S., Smith, A.: Smooth sensitivity and sampling in private data analysis. In: STOC 2007: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 75\u201384. ACM, New York (2007)"},{"key":"18_CR35","unstructured":"Samarati, P., Sweeney, L.: Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical Report SRI-CSL-98-04, SRI Computer Science Laboratory (1998)"},{"issue":"5","key":"18_CR36","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: k-anonymity: A model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst.\u00a010(5), 557\u2013570 (2002)","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40935-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,6]],"date-time":"2022-03-06T23:47:17Z","timestamp":1646610437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40935-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409349","9783642409356"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40935-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}