{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T20:29:17Z","timestamp":1726000157362},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030042110"},{"type":"electronic","value":"9783030042127"}],"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"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04212-7_17","type":"book-chapter","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T07:01:33Z","timestamp":1542351693000},"page":"191-204","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Privacy-Preserving K-Means Clustering Upon Negative Databases"],"prefix":"10.1007","author":[{"given":"Xiaoyi","family":"Hu","sequence":"first","affiliation":[]},{"given":"Liping","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Dongdong","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Jianwen","family":"Xiang","sequence":"additional","affiliation":[]},{"given":"Xing","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Haiying","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Shengwu","family":"Xiong","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/j.spl.2012.10.032","volume":"83","author":"Y Bao","year":"2013","unstructured":"Bao, Y., Luo, W., Zhang, X.: Estimating positive surveys from negative surveys. Stat. Prob. Lett. 83(2), 551\u2013558 (2013)","journal-title":"Stat. Prob. Lett."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bringer, J., Chabanne, H.: Negative databases for biometric data. In: Proceedings of the 12th ACM Workshop on Multimedia and Security, pp. 55\u201362. ACM (2010)","DOI":"10.1145\/1854229.1854242"},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s10115-010-0362-4","volume":"29","author":"K Chen","year":"2011","unstructured":"Chen, K., Liu, L.: Geometric data perturbation for privacy preserving outsourced data mining. Knowl. Inf. Syst. 29(3), 657\u2013695 (2011)","journal-title":"Knowl. Inf. Syst."},{"key":"17_CR4","unstructured":"Dasgupta, D., Azeem, R.: An investigation of negative authentication systems. In: Proceedings of 3rd International Conference on Information Warfare and Security, pp. 117\u2013126 (2008)"},{"key":"17_CR5","series-title":"Infosys Science Foundation Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-58808-7_3","volume-title":"Advances in User Authentication","author":"D Dasgupta","year":"2017","unstructured":"Dasgupta, D., Roy, A., Nag, A.: Negative authentication systems. Advances in User Authentication. ISFS, pp. 85\u2013145. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58808-7_3"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Dasgupta, D., Saha, S.: A biologically inspired password authentication system. In: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies, p. 41. ACM (2009)","DOI":"10.1145\/1558607.1558654"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Dasgupta, D., Saha, S.: Password security through negative filtering. In: 2010 International Conference on Emerging Security Technologies (EST), pp. 83\u201389. IEEE (2010)","DOI":"10.1109\/EST.2010.37"},{"key":"17_CR8","unstructured":"Dheeru, D., Karra Taniskidou, E.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml. Accessed 27 Aug 2018"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Dhiraj, S.S., Khan, A.M.A., Khan, W., Challagalla, A.: Privacy preservation in k-means clustering by cluster rotation. In: TENCON 2009\u20132009 IEEE Region 10 Conference, pp. 1\u20137. IEEE (2009)","DOI":"10.1109\/TENCON.2009.5396140"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/MCI.2008.919079","volume":"3","author":"F Esponda","year":"2008","unstructured":"Esponda, F.: Everything that is not important: negative databases [research frontier]. IEEE Comput. Intell. Mag. 3(2), 60\u201363 (2008)","journal-title":"IEEE Comput. Intell. Mag."},{"key":"17_CR11","unstructured":"Esponda, F.: Negative surveys. arXiv preprint. arXiv: math\/0608176 (2006)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-88961-8_2","volume-title":"Information Hiding","author":"F Esponda","year":"2008","unstructured":"Esponda, F.: Hiding a needle in a haystack using negative databases. In: Solanki, K., Sullivan, K., Madhow, U. (eds.) IH 2008. LNCS, vol. 5284, pp. 15\u201329. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88961-8_2"},{"issue":"6","key":"17_CR13","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10207-007-0030-1","volume":"6","author":"F Esponda","year":"2007","unstructured":"Esponda, F., Ackley, E.S., Helman, P., Jia, H., Forrest, S.: Protecting data privacy through hard-to-reverse negative databases. Int. J. Inf. Secur. 6(6), 403\u2013415 (2007)","journal-title":"Int. J. Inf. Secur."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Esponda, F., Forrest, S., Helman, P.: Enhancing privacy through negative representations of data. Technical report, Department of Computer Science, University of New Mexico (2004)","DOI":"10.21236\/ADA498766"},{"key":"17_CR15","unstructured":"Esponda, F., Trias, E.D., Ackley, E.S., Forrest, S.: A relational algebra for negative databases. University of New Mexico, Technical report (2007)"},{"key":"17_CR16","unstructured":"Ferris, B., Froehlich, J.: WalkSAT as an informed heuristic to DPLL in sat solving. Technical report, CSE 573: Artificial Intelligence (2004)"},{"issue":"1","key":"17_CR17","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm as 136: a k-means clustering algorithm. J. R. Stat. Soc. Ser. C (Appl. Stat.) 28(1), 100\u2013108 (1979)","journal-title":"J. R. Stat. Soc. Ser. C (Appl. Stat.)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 593\u2013599. ACM (2005)","DOI":"10.1145\/1081870.1081942"},{"key":"17_CR19","unstructured":"Jia, H., Moore, C., Strain, D.: Generating hard satisfiable formulas by hiding solutions deceptiveily. In: National Conference on Artificial Intelligence, pp. 384\u2013389 (2005)"},{"issue":"3","key":"17_CR20","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s10115-016-0923-2","volume":"49","author":"KP Lin","year":"2016","unstructured":"Lin, K.P.: Privacy-preserving kernel k-means clustering outsourcing with random transformation. Knowl. Inf. Syst. 49(3), 885\u2013908 (2016)","journal-title":"Knowl. Inf. Syst."},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Liu, R., Luo, W., Wang, X.: A hybrid of the prefix algorithm and the q-hidden algorithm for generating single negative databases. In: 2011 IEEE Symposium on Computational Intelligence in Cyber Security (CICS), pp. 31\u201338. IEEE (2011)","DOI":"10.1109\/CICYBS.2011.5949400"},{"issue":"6","key":"17_CR22","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1007\/s11704-013-2318-9","volume":"7","author":"R Liu","year":"2013","unstructured":"Liu, R., Luo, W., Yue, L.: Classifying and clustering in negative databases. Front. Comput. Sci. 7(6), 864\u2013874 (2013)","journal-title":"Front. Comput. Sci."},{"issue":"1","key":"17_CR23","first-page":"43","volume":"2","author":"R Liu","year":"2014","unstructured":"Liu, R., Luo, W., Yue, L.: The p-hidden algorithm: hiding single databases more deeply. Immune Comput. 2(1), 43\u201355 (2014)","journal-title":"Immune Comput."},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/11527695_27","volume-title":"Theory and Applications of Satisfiability Testing","author":"YS Mahajan","year":"2005","unstructured":"Mahajan, Y.S., Fu, Z., Malik, S.: Zchaff2004: an efficient SAT solver. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 360\u2013375. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11527695_27"},{"key":"17_CR25","unstructured":"Oliveira, S., Zaiane, O.: Data perturbation by rotation for privacy-preserving clustering. Technical report TR04-17 (2004)"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-36071-8_33","volume-title":"Distributed Computing and Internet Technology","author":"S Patel","year":"2013","unstructured":"Patel, S., Patel, V., Jinwala, D.: Privacy preserving distributed k-means clustering in malicious model using zero knowledge proof. In: Hota, C., Srimani, P.K. (eds.) ICDCIT 2013. LNCS, vol. 7753, pp. 420\u2013431. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36071-8_33"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-642-04244-7_51","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"K Pipatsrisawat","year":"2009","unstructured":"Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers with restarts. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 654\u2013668. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_51"},{"key":"17_CR28","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: AAAI, vol. 94, pp. 337\u2013343 (1994)"},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 206\u2013215. ACM (2003)","DOI":"10.1145\/956755.956776"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"Zhao, D., Luo, W., Liu, R., Yue, L.: A fine-grained algorithm for generating hard-toreverse negative databases. In: 2015 International Workshop on Artificial Immune Systems (AIS), pp. 1\u20138 (2015)","DOI":"10.1109\/AISW.2015.7469244"},{"issue":"1","key":"17_CR31","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1109\/TDSC.2015.2507133","volume":"15","author":"D Zhao","year":"2018","unstructured":"Zhao, D., Luo, W., Liu, R., Yue, L.: Negative iris recognition. IEEE Trans. Dependable Secure Comput. 15(1), 112\u2013125 (2018)","journal-title":"IEEE Trans. Dependable Secure Comput."}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04212-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:06:35Z","timestamp":1710248795000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04212-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030042110","9783030042127"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04212-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siem Reap","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambodia","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":"13 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/iconip\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"575","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"401","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"70% - 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 (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}