{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:33:40Z","timestamp":1742913220954,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030584481"},{"type":"electronic","value":"9783030584498"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58449-8_9","type":"book-chapter","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T23:03:51Z","timestamp":1600211031000},"page":"128-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Formal Learning Theory for Three-Way Clustering"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Campagner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8083-7809","authenticated-orcid":false,"given":"Davide","family":"Ciucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,16]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ijar.2019.11.011","volume":"118","author":"MK Afridi","year":"2020","unstructured":"Afridi, M.K., Azam, N., Yao, J.: Variance based three-way clustering approaches for handling overlapping clustering. Int. J. Approximate Reasoning 118, 47\u201363 (2020)","journal-title":"Int. J. Approximate Reasoning"},{"key":"9_CR2","first-page":"121","volume":"2009","author":"S Ben-David","year":"2009","unstructured":"Ben-David, S., Ackerman, M.: Measures of clustering quality: A working set of axioms for clustering. Proc. NIPS 2009, 121\u2013128 (2009)","journal-title":"Proc. NIPS"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0098-3004(84)90020-7","volume":"10","author":"JC Bezdek","year":"1984","unstructured":"Bezdek, J.C., Ehrlich, R., Full, W.: Fcm: The fuzzy c-means clustering algorithm. Comput. Geosci. 10(2), 191\u2013203 (1984)","journal-title":"Comput. Geosci."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.knosys.2019.05.018","volume":"180","author":"A Campagner","year":"2019","unstructured":"Campagner, A., Ciucci, D.: Orthopartitions and soft clustering: Soft mutual information measures for clustering validation. Knowl. Based Syst. 180, 51\u201361 (2019)","journal-title":"Knowl. Based Syst."},{"issue":"3","key":"9_CR5","first-page":"149","volume":"12","author":"D Chen","year":"2006","unstructured":"Chen, D., Cui, D.W., Wang, C.X., Wang, Z.R.: A rough set-based hierarchical clustering algorithm for categorical data. Int. J. Inf. Technol. 12(3), 149\u2013159 (2006)","journal-title":"Int. J. Inf. Technol."},{"key":"9_CR6","unstructured":"Dasgupta, S.: The hardness of k-means clustering. Department of Computer Science and Engineering, University of California, San Diego, Technical report (2008)"},{"key":"9_CR7","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-42972-4_20","volume-title":"Soft Methods for Data Science","author":"T Den\u0153ux","year":"2017","unstructured":"Den\u0153ux, T., Kanjanatarakul, O.: Beyond fuzzy, possibilistic and rough: An investigation of belief functions in clustering. In: Ferraro, M.B., Giordani, P., Vantaggi, B., Gagolewski, M., Gil, M.\u00c1., Grzegorzewski, P., Hryniewicz, O. (eds.) Soft Methods for Data Science. AISC, vol. 456, pp. 157\u2013164. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-42972-4_20"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1109\/TSMCB.2002.806496","volume":"34","author":"T Den\u0153ux","year":"2004","unstructured":"Den\u0153ux, T., Masson, M.H.: Evclus: Evidential clustering of proximity data. IEEE Trans. Syst. Man Cybern. 34(1), 95\u2013109 (2004)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"9_CR9","first-page":"2272","volume":"5","author":"K Kameshwaran","year":"2014","unstructured":"Kameshwaran, K., Malarvizhi, K.: Survey on clustering techniques in data mining. IJCSIT 5(2), 2272\u20132276 (2014)","journal-title":"IJCSIT"},{"key":"9_CR10","first-page":"463","volume":"2003","author":"JM Kleinberg","year":"2003","unstructured":"Kleinberg, J.M.: An impossibility theorem for clustering. Pro. NIPS 2003, 463\u2013470 (2003)","journal-title":"Pro. NIPS"},{"issue":"6","key":"9_CR11","first-page":"90","volume":"1","author":"TM Kodinariya","year":"2013","unstructured":"Kodinariya, T.M., Makwana, P.R.: Review on determining number of cluster in k-means clustering. Int. J. Adv. Res. Comput. Sci. Manag. Stud. 1(6), 90\u201395 (2013)","journal-title":"Int. J. Adv. Res. Comput. Sci. Manag. Stud."},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/92.238426","volume":"1","author":"R Krishnapuram","year":"1993","unstructured":"Krishnapuram, R., Keller, J.M.: A possibilistic approach to clustering. IEEE Trans. Syst. 1(2), 98\u2013110 (1993)","journal-title":"IEEE Trans. Syst."},{"key":"9_CR13","first-page":"65","volume":"1","author":"P Lingras","year":"2011","unstructured":"Lingras, P., Peters, G.: Rough clustering. WIREs Data Min. Knowl. Discov. 1, 65\u201372 (2011)","journal-title":"WIREs Data Min. Knowl. Discov."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-642-02962-2_9","volume-title":"Rough Sets and Knowledge Technology","author":"P Lingras","year":"2009","unstructured":"Lingras, P.: Evolutionary rough K-means clustering. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds.) RSKT 2009. LNCS (LNAI), vol. 5589, pp. 68\u201375. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02962-2_9"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/B:JIIS.0000029668.88665.1a","volume":"23","author":"P Lingras","year":"2004","unstructured":"Lingras, P., West, C.: Interval set clustering of web users with rough k-means. J. Intell. Inf. Syst. 23(1), 5\u201316 (2004)","journal-title":"J. Intell. Inf. Syst."},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Loh, W.K., Park, Y.H.: A survey on density-based clustering algorithms. In: Ubiquitous Information Technologies and Applications, pp. 775\u2013780. Springer, Berlin (2014)","DOI":"10.1007\/978-3-642-41671-2_98"},{"key":"9_CR17","unstructured":"MacKay, D.J.C.: Information Theory, Inference and Learning Algorithms. Cambridge University Press, New York (2002)"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1016\/j.patcog.2009.09.029","volume":"43","author":"S Mitra","year":"2010","unstructured":"Mitra, S., Pedrycz, W., Barman, B.: Shadowed c-means: Integrating fuzzy and rough clustering. Pattern Recogn. 43(4), 1282\u20131291 (2010)","journal-title":"Pattern Recogn."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Murugesan, V.P., Murugesan, P.: A new initialization and performance measure for the rough k-means clustering. Soft Comput. 1\u201315 (2020)","DOI":"10.1007\/s00500-019-04625-9"},{"issue":"15","key":"9_CR20","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1016\/j.patrec.2005.05.001","volume":"26","author":"W Pedrycz","year":"2005","unstructured":"Pedrycz, W.: Interpretation of clusters in the framework of shadowed sets. Pattern Recogn. Lett. 26(15), 2439\u20132449 (2005)","journal-title":"Pattern Recogn. Lett."},{"issue":"8","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1016\/j.patcog.2006.02.002","volume":"39","author":"G Peters","year":"2006","unstructured":"Peters, G.: Some refinements of rough k-means clustering. Pattern Recogn. 39(8), 1481\u20131491 (2006)","journal-title":"Pattern Recogn."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1016\/j.ins.2014.02.073","volume":"277","author":"G Peters","year":"2014","unstructured":"Peters, G.: Rough clustering utilizing the principle of indifference. Inf. Sci. 277, 358\u2013374 (2014)","journal-title":"Inf. Sci."},{"issue":"2","key":"9_CR23","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.ijar.2012.10.003","volume":"54","author":"G Peters","year":"2013","unstructured":"Peters, G., Crespo, F., Lingras, P., Weber, R.: Soft clustering-fuzzy and rough approaches and their extensions and derivatives. Int. J. Approximate Reason. 54(2), 307\u2013322 (2013)","journal-title":"Int. J. Approximate Reason."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Reddy, C.K., Vinzamuri, B.: A survey of partitional and hierarchical clustering algorithms. In: Data Clustering, pp. 87\u2013110. Chapman and Hall\/CRC (2018)","DOI":"10.1201\/9781315373515-4"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TPAMI.1984.4767478","volume":"1","author":"SZ Selim","year":"1984","unstructured":"Selim, S.Z., Ismail, M.A.: K-means-type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Trans. Pattern Anal. Mach. Intell. 1, 81\u201387 (1984)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: From Theory to Algorithms","author":"S Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press, Cambridge (2014)"},{"issue":"6","key":"9_CR27","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.3923\/itj.2011.1092.1105","volume":"10","author":"S Vijendra","year":"2011","unstructured":"Vijendra, S.: Efficient clustering for high dimensional data: Subspace based clustering and density based clustering. Inf. Technol. J. 10(6), 1092\u20131105 (2011)","journal-title":"Inf. Technol. J."},{"issue":"10","key":"9_CR28","doi-asserted-by":"publisher","first-page":"2767","DOI":"10.1007\/s13042-018-0901-y","volume":"10","author":"P Wang","year":"2019","unstructured":"Wang, P., Shi, H., Yang, X., Mi, J.: Three-way k-means: Integrating k-means and three-way decision. Int. J. Mach. Learn. Cybern. 10(10), 2767\u20132777 (2019). \nhttps:\/\/doi.org\/10.1007\/s13042-018-0901-y","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.knosys.2018.04.029","volume":"155","author":"P Wang","year":"2018","unstructured":"Wang, P., Yao, Y.: Ce3: A three-way clustering method based on mathematical morphology. Knowl. Based Syst. 155, 54\u201365 (2018)","journal-title":"Knowl. Based Syst."},{"key":"9_CR30","doi-asserted-by":"publisher","DOI":"10.1002\/9780470382776","volume-title":"Clustering","author":"R Xu","year":"2008","unstructured":"Xu, R., Wunsch, D.: Clustering, vol. 10. Wiley, Hoboken (2008)"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-642-10646-0_48","volume-title":"Rough Sets, Fuzzy Sets, Data Mining and Granular Computing","author":"Y Yao","year":"2009","unstructured":"Yao, Y., Lingras, P., Wang, R., Miao, D.: Interval set cluster analysis: a re-formulation. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., \u015al\u0119zak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS (LNAI), vol. 5908, pp. 398\u2013405. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-10646-0_48"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-319-60840-2_22","volume-title":"Rough Sets","author":"H Yu","year":"2017","unstructured":"Yu, H.: A framework of three-way cluster analysis. In: Polkowski, L., Yao, Y., Artiemjew, P., Ciucci, D., Liu, D., \u015al\u0119zak, D., Zielosko, B. (eds.) IJCRS 2017. LNCS (LNAI), vol. 10314, pp. 300\u2013312. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-60840-2_22"},{"issue":"5","key":"9_CR33","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1007\/s13042-019-00988-5","volume":"11","author":"H Yu","year":"2019","unstructured":"Yu, H., Chang, Z., Wang, G., Chen, X.: An efficient three-way clustering algorithm based on gravitational search. Int. J. Mach. Learn. Cybern. 11(5), 1003\u20131016 (2019). \nhttps:\/\/doi.org\/10.1007\/s13042-019-00988-5","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"9_CR34","doi-asserted-by":"publisher","first-page":"122289","DOI":"10.1016\/j.physa.2019.122289","volume":"535","author":"H Yu","year":"2019","unstructured":"Yu, H., Chen, L., Yao, J., Wang, X.: A three-way clustering method based on an improved dbscan algorithm. Physica A Stat. Mech. Appl. 535, 122289 (2019)","journal-title":"Physica A Stat. Mech. Appl."},{"key":"9_CR35","unstructured":"Zadeh, R.B., Ben-David, S.: A uniqueness theorem for clustering. In: Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, pp. 639\u2013646 (2009)"},{"key":"9_CR36","doi-asserted-by":"publisher","first-page":"105536","DOI":"10.1016\/j.asoc.2019.105536","volume":"82","author":"K Zhang","year":"2019","unstructured":"Zhang, K.: A three-way c-means algorithm. Appl. Soft Comput. 82, 105536 (2019)","journal-title":"Appl. Soft Comput."}],"container-title":["Lecture Notes in Computer Science","Scalable Uncertainty Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58449-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T23:06:20Z","timestamp":1600211180000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58449-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584481","9783030584498"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58449-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"16 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SUM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Scalable Uncertainty Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bozen-Bolzano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sum2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sum2020.inf.unibz.it\/","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":"30","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":"12","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":"7","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":"40% - 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":"3,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":"3","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)"}}]}}