{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T12:06:14Z","timestamp":1773057974438,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030014230","type":"print"},{"value":"9783030014247","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-01424-7_79","type":"book-chapter","created":{"date-parts":[[2018,10,1]],"date-time":"2018-10-01T17:07:37Z","timestamp":1538413657000},"page":"817-827","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Topological k-Anonymity Model Based on Collaborative Multi-view Clustering"],"prefix":"10.1007","author":[{"given":"Sarah","family":"Zouinina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nistor","family":"Grozavu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youn\u00e8s","family":"Bennani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelouahid","family":"Lyhyaoui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicoleta","family":"Rogovschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,27]]},"reference":[{"key":"79_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: ACM Sigmod Record, vol. 29, pp. 439\u2013450. ACM (2000)","DOI":"10.1145\/335191.335438"},{"key":"79_CR2","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R.: Data privacy through optimal k-anonymization. In: Proceedings of the 21st International Conference on Data Engineering. ICDE 2005, pp. 217\u2013228. IEEE (2005)","DOI":"10.1109\/ICDE.2005.42"},{"key":"79_CR3","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"},{"key":"79_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.inffus.2017.04.008","volume":"39","author":"A Cornu\u00e9jols","year":"2018","unstructured":"Cornu\u00e9jols, A., Wemmert, C., Gan\u00e7arski, P., Bennani, Y.: Collaborative clustering: why, when, what and how. Inf. Fusion 39, 81\u201395 (2018). https:\/\/doi.org\/10.1016\/j.inffus.2017.04.008","journal-title":"Inf. Fusion"},{"issue":"2","key":"79_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","volume":"1","author":"DL Davies","year":"1979","unstructured":"Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. PAMI 1(2), 224\u2013227 (1979). https:\/\/doi.org\/10.1109\/TPAMI.1979.4766909","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. PAMI"},{"key":"79_CR6","unstructured":"Dheeru, D., Karra Taniskidou, E.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"79_CR7","doi-asserted-by":"publisher","unstructured":"Ghassany, M., Grozavu, N., Bennani, Y.: Collaborative multi-view clustering. In: The 2013 International Joint Conference on Neural Networks, IJCNN 2013, Dallas, TX, USA, August 4\u20139, 2013, pp. 1\u20138. IEEE (2013). https:\/\/doi.org\/10.1109\/IJCNN.2013.6707037","DOI":"10.1109\/IJCNN.2013.6707037"},{"key":"79_CR8","unstructured":"Grozavu, N., Bennani, Y.: Topological Collaborative Clustering. In: 17th International Conference on Neural Information Processing, LNCS. ICONIP 2010. Springer (2010)"},{"key":"79_CR9","doi-asserted-by":"crossref","unstructured":"Grozavu, N., Ghassany, M., Bennani, Y.: Learning confidence exchange in collaborative clustering. In: IJCNN. pp. 872\u2013879 (2011)","DOI":"10.1109\/IJCNN.2011.6033313"},{"key":"79_CR10","doi-asserted-by":"crossref","unstructured":"Huang, Z., Du, W., Chen, B.: Deriving private information from randomized data. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 37\u201348. ACM (2005)","DOI":"10.1145\/1066157.1066163"},{"key":"79_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-97610-0","volume-title":"Self-organizing Maps","author":"T Kohonen","year":"1995","unstructured":"Kohonen, T.: Self-organizing Maps. Springer-Verlag, Berlin (1995). https:\/\/doi.org\/10.1007\/978-3-642-97610-0"},{"key":"79_CR12","doi-asserted-by":"crossref","unstructured":"LeFevre, K., DeWitt, D.J., Ramakrishnan, R.: Mondrian multidimensional k-anonymity. In: Proceedings of the 22nd International Conference on Data Engineering. ICDE 2006, pp. 25\u201325. IEEE (2006)","DOI":"10.1109\/ICDE.2006.101"},{"key":"79_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/11823728_39","volume-title":"Data Warehousing and Knowledge Discovery","author":"J Li","year":"2006","unstructured":"Li, J., Wong, R.C.-W., Fu, A.W.-C., Pei, J.: Achieving k-anonymity by clustering in attribute hierarchical structures. In: Tjoa, A.M., Trujillo, J. (eds.) DaWaK 2006. LNCS, vol. 4081, pp. 405\u2013416. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11823728_39"},{"key":"79_CR14","doi-asserted-by":"crossref","unstructured":"Loukides, G., Shao, J.: Capturing data usefulness and privacy protection in k-anonymisation. In: Proceedings of the 2007 ACM Symposium on Applied Computing, pp. 370\u2013374. ACM (2007)","DOI":"10.1145\/1244002.1244091"},{"key":"79_CR15","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M.: l-diversity: Privacy beyond k-anonymity 1(1), 3. http:\/\/dl.acm.org\/citation.cfm?id=1217302","DOI":"10.1145\/1217299.1217302"},{"issue":"14","key":"79_CR16","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1016\/S0167-8655(02)00130-7","volume":"23","author":"W Pedrycz","year":"2002","unstructured":"Pedrycz, W.: Collaborative fuzzy clustering. Pattern Recognit. Lett. 23(14), 1675\u20131686 (2002)","journal-title":"Pattern Recognit. Lett."},{"issue":"5","key":"79_CR17","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: Achieving k-anonymity privacy protection using generalization and suppression. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 10(5), 571\u2013588 (2002)","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."}],"container-title":["Lecture Notes in Computer Science","Artificial Neural Networks and Machine Learning \u2013 ICANN 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01424-7_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T09:29:18Z","timestamp":1773048558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-01424-7_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030014230","9783030014247"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01424-7_79","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":"27 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICANN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Neural Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rhodes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"4 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icann2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/e-nns.org\/icann2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easyacademia.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"360","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":"139","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":"28","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":"39% - 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":"2","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition there are 41 full poster papers and 11 short poster papers included in the proceedings","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}