{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T15:15:03Z","timestamp":1784733303552,"version":"3.55.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030050535","type":"print"},{"value":"9783030050542","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05054-2_36","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T19:33:21Z","timestamp":1544124801000},"page":"462-476","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["K-Anonymity Algorithm Based on Improved Clustering"],"prefix":"10.1007","author":[{"given":"Wantong","family":"Zheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhongyue","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tongtong","family":"Lv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunfu","family":"Jia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Kenthapadi, K., Khuller, S., Panigrahy, R., Thomas, D., Zhu, A.: Achieving anonymity via clustering. In: ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 153\u2013162 (2006)","DOI":"10.1145\/1142351.1142374"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-71703-4_18","volume-title":"Advances in Databases: Concepts, Systems and Applications","author":"J-W Byun","year":"2007","unstructured":"Byun, J.-W., Kamra, A., Bertino, E., Li, N.: Efficient k-anonymization using clustering techniques. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 188\u2013200. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71703-4_18"},{"issue":"4","key":"36_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1749603.1749605","volume":"42","author":"BCM Fung","year":"2010","unstructured":"Fung, B.C.M., Wang, K., Chen, R., Yu, P.S.: Privacy-preserving data publishing: a survey of recent developments. ACM Comput. Surv. 42(4), 14 (2010)","journal-title":"ACM Comput. Surv."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Fung, B.C.M., Wang, K., Yu, P.S.: Top-down specialization for information and privacy preservation. In: International Conference on Data Engineering, pp. 205\u2013216 (2005)","DOI":"10.1109\/ICDE.2005.143"},{"issue":"8","key":"36_CR5","doi-asserted-by":"publisher","first-page":"2034","DOI":"10.1109\/TKDE.2015.2405563","volume":"27","author":"O Gkountouna","year":"2015","unstructured":"Gkountouna, O., Terrovitis, M.: Anonymizing collections of tree-structured data. IEEE Trans. Knowl. Data Eng. 27(8), 2034\u20132048 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Lefevre, K., Dewitt, D.J., Ramakrishnan, R.: Mondrian multidimensional k-anonymity. In: International Conference on Data Engineering, p. 25 (2006)","DOI":"10.1109\/ICDE.2006.101"},{"issue":"99","key":"36_CR7","first-page":"1","volume":"PP","author":"H Li","year":"2016","unstructured":"Li, H., Zhu, H., Du, S., Liang, X., Shen, X.: Privacy leakage of location sharing in mobile social networks: attacks and defense. IEEE Trans. Dependable Sec. Comput. PP(99), 1 (2016)","journal-title":"IEEE Trans. Dependable Sec. Comput."},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Lin, J.L., Wei, M.C.: An efficient clustering method for k-anonymization. In: International Workshop on Privacy and Anonymity in Information Society, pp. 46\u201350. ACM (2008)","DOI":"10.1145\/1379287.1379297"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: Proceedings of the ACM Symposium on Principles of Database Systems, PODS 2004, pp. 223\u2013228. ACM (2004)","DOI":"10.1145\/1055558.1055591"},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/2976738","volume":"19","author":"I Ozalp","year":"2016","unstructured":"Ozalp, I., Gursoy, M.E., Nergiz, M.E., Saygin, Y.: Privacy-preserving publishing of hierarchical data. ACM Trans. Priv. Secur. 19(3), 7 (2016)","journal-title":"ACM Trans. Priv. Secur."},{"issue":"2","key":"36_CR11","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/3125622","volume":"18","author":"B Palanisamy","year":"2018","unstructured":"Palanisamy, B., Liu, L., Zhou, Y., Wang, Q.: Privacy-preserving publishing of multilevel utility-controlled graph datasets. ACM Trans. Internet Technol. 18(2), 24 (2018)","journal-title":"ACM Trans. Internet Technol."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Samarati, P., Sweeney, L.: Generalizing data to provide anonymity when disclosing information. In: The ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, vol. 98, p. 188. Citeseer (1998)","DOI":"10.1145\/275487.275508"},{"key":"36_CR13","unstructured":"Samarati, P., Sweeney, L.: Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical report, SRI International (1998)"},{"issue":"05","key":"36_CR14","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. Uncertainty Fuzziness Knowl.-Based Syst. 10(05), 557\u2013570 (2002)","journal-title":"Int. J. Uncertainty Fuzziness Knowl.-Based Syst."},{"key":"36_CR15","unstructured":"Wang, K., Yu, P.S., Chakraborty, S.: Bottom-up generalization: a data mining solution to privacy protection, pp. 249\u2013256. IEEE (2004)"},{"issue":"2","key":"36_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1233321.1233324","volume":"8","author":"J Xu","year":"2006","unstructured":"Xu, J., Wang, W., Pei, J., Wang, X., Shi, B., Fu, A.W.C.: Utility-based anonymization for privacy preservation with less information loss. ACM SIGKDD Explorations Newsl. 8(2), 21\u201330 (2006)","journal-title":"ACM SIGKDD Explorations Newsl."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05054-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T09:56:05Z","timestamp":1775296565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05054-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050535","9783030050542"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05054-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}