{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T23:37:42Z","timestamp":1772667462978,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642141645","type":"print"},{"value":"9783642141652","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14165-2_17","type":"book-chapter","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T09:26:02Z","timestamp":1278321962000},"page":"188-200","source":"Crossref","is-referenced-by-count":18,"title":["Clustering with Diversity"],"prefix":"10.1007","author":[{"given":"Jian","family":"Li","sequence":"first","affiliation":[]},{"given":"Ke","family":"Yi","sequence":"additional","affiliation":[]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., Zhu, A.: Achieving anonymity via clustering. In: PODS, pp. 153\u2013162 (2006)","DOI":"10.1145\/1142351.1142374"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-30570-5_17","volume-title":"Database Theory - ICDT 2005","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu, A.: Anonymizing tables. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 246\u2013258. Springer, Heidelberg (2004)"},{"issue":"5","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N. Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: Ranking and clustering. J. ACM\u00a055(5), 1\u201327 (2008)","journal-title":"J. ACM"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Arasu, A., R\u00e9, C., Suciu, D.: Large-scale deduplication with constraints using Dedupalog. In: ICDE, pp. 952\u2013963 (2009)","DOI":"10.1109\/ICDE.2009.43"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1093\/nar\/25.1.31","volume":"25","author":"A. Bairoch","year":"1997","unstructured":"Bairoch, A., Apweiler, R.: The SWISS-PROT protein sequence data bank and its supplement TrEMBL. Nucleic acids research\u00a025(1), 31 (1997)","journal-title":"Nucleic acids research"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N. Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Machine Learning\u00a056(1), 89\u2013113 (2004)","journal-title":"Machine Learning"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Beresford, A., Stajano, F.: Location privacy in pervasive computing. IEEE Pervasive Computing, 46\u201355 (2003)","DOI":"10.1109\/MPRV.2003.1186725"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Wong, R.C.-W., Li, J., Fu, A.-C., Wang, K.: (\u03b1, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing. In: SIGKDD, pp. 754\u2013759 (2006)","DOI":"10.1145\/1150402.1150499"},{"key":"17_CR9","unstructured":"Charikar, M., Khuller, S., Mount, D., Narasimhan, G.: Algorithms for facility location problems with outliers. In: SODA, pp. 642\u2013651 (2001)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Davidson, I., Ravi, S.: Intractability and clustering with constraints. In: ICML, pp. 201\u2013208 (2007)","DOI":"10.1145\/1273496.1273522"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Naor, M., Reingold, O., Rothblum, G., Vadhan, S.: On the complexity of differentially private data release: efficient algorithms and hardness results. In: STOC, pp. 381\u2013390 (2009)","DOI":"10.1145\/1536414.1536467"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Feldman, D., Fiat, A., Kaplan, H., Nissim, K.: Private coresets. In: STOC, pp. 361\u2013370 (2009)","DOI":"10.1145\/1536414.1536465"},{"key":"17_CR13","unstructured":"Ghinita, G., Karras, P., Kalnis, P., Mamoulis, N.: Fast data anonymization with low information loss. In: VLDB, pp. 758\u2013769 (2007)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Giotis, I., Guruswami, V.: Correlation clustering with a fixed number of clusters. In: SODA, pp. 1176\u20131185 (2006)","DOI":"10.1145\/1109557.1109686"},{"key":"17_CR15","unstructured":"Hoppner, F., Klawonn, F., Platz, R., Str, S.: Clustering with Size Constraints. Computational Intelligence Paradigms: Innovative Applications (2008)"},{"key":"17_CR16","unstructured":"Ji, X.: Graph Partition Problems with Minimum Size Constraints. PhD thesis, Rensselaer Polytechnic Institute (2004)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Kifer, D., Gehrke, J.: Injecting utility into anonymized datasets. In: SIGMOD, pp. 217\u2013228 (2006)","DOI":"10.1145\/1142473.1142499"},{"key":"17_CR18","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B. Korte","year":"2007","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 4th edn. Springer, Heidelberg (2007)","edition":"4"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Mondrian multidimensional k-anonymity. In: ICDE, p. 25 (2006)","DOI":"10.1109\/ICDE.2006.101"},{"key":"17_CR20","unstructured":"Li, J., Yi, K., Zhang, Q.: Clustering with diversity (2010), http:\/\/arxiv.org\/abs\/1004.2968"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Gehrke, J., Kifer, D., Venkitasubramaniam, M.: l-diversity: Privacy beyond k-anonymity. In: ICDE, p. 24 (2006)","DOI":"10.1109\/ICDE.2006.1"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: PODS, pp. 223\u2013228 (2004)","DOI":"10.1145\/1055558.1055591"},{"key":"17_CR23","volume-title":"Algorithms: Design Techniques and Analysis","author":"M.H. Alsuwaiyel","year":"1998","unstructured":"Alsuwaiyel, M.H.: Algorithms: Design Techniques and Analysis. World Scientific, Singapore (1998)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Park, H., Shim, K.: Approximate algorithms for k-anonymity. In: SIGMOD (2007)","DOI":"10.1145\/1247480.1247490"},{"issue":"6","key":"17_CR25","first-page":"1010","volume":"13","author":"P. Samarati","year":"2001","unstructured":"Samarati, P.: Protecting respondents\u2019 identities in microdata release. TKDE\u00a013(6), 1010\u20131027 (2001)","journal-title":"TKDE"},{"key":"17_CR26","unstructured":"Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: ICML, pp. 1103\u20131110 (2000)"},{"key":"17_CR27","unstructured":"Wagstaff, K., Cardie, C., Schroedl, S.: Constrained k-means clustering with background knowledge. In: ICML, pp. 577\u2013584 (2001)"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"Xiao, X., Tao, Y.: Anatomy: Simple and effective privacy preservation. In: VLDB, pp. 139\u2013150 (2006)","DOI":"10.1145\/1142473.1142500"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Xiao, X., Tao, Y.: m-invariance: Towards privacy preserving re-publication of dynamic datasets. In: SIGMOD, pp. 689\u2013700 (2007)","DOI":"10.1145\/1247480.1247556"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Xiao, X., Yi, K., Tao, Y.: The hardness and approximation algorithms for l-diversity. In: EDBT (2010)","DOI":"10.1145\/1739041.1739060"},{"key":"17_CR31","unstructured":"Xing, E., Ng, A., Jordan, M., Russell, S.: Distance metric learning, with application to clustering with side-information. In: NIPS, pp. 505\u2013512 (2003)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14165-2_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,1]],"date-time":"2023-06-01T18:41:30Z","timestamp":1685644890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14165-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642141645","9783642141652"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14165-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}