{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:35:43Z","timestamp":1760524543857,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031452741"},{"type":"electronic","value":"9783031452758"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-45275-8_33","type":"book-chapter","created":{"date-parts":[[2023,10,7]],"date-time":"2023-10-07T06:01:56Z","timestamp":1696658516000},"page":"492-507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Interpretable Data Partitioning Through Tree-Based Clustering Methods"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2827-7613","authenticated-orcid":false,"given":"Riccardo","family":"Guidotti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4907-9728","authenticated-orcid":false,"given":"Cristiano","family":"Landi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8531-9325","authenticated-orcid":false,"given":"Andrea","family":"Beretta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0051-0604","authenticated-orcid":false,"given":"Daniele","family":"Fadda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3534-4332","authenticated-orcid":false,"given":"Mirco","family":"Nanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,8]]},"reference":[{"issue":"1","key":"33_CR1","first-page":"121","volume":"17","author":"J Basak","year":"2005","unstructured":"Basak, J., Krishnapuram, R.: Interpretable hierarchical clustering by constructing an unsupervised decision tree. IEEE TKDE 17(1), 121\u2013132 (2005)","journal-title":"IEEE TKDE"},{"issue":"1","key":"33_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10994-020-05896-2","volume":"110","author":"D Bertsimas","year":"2021","unstructured":"Bertsimas, D., Orfanoudaki, A., Wiberg, H.M.: Interpretable clustering: an optimization approach. Mach. Learn. 110(1), 89\u2013138 (2021)","journal-title":"Mach. Learn."},{"key":"33_CR3","unstructured":"Blockeel, H., Raedt, L.D., Ramon, J.: Top-down induction of clustering trees. In: ICML, pp. 55\u201363. Morgan Kaufmann (1998)"},{"key":"33_CR4","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and regression trees. Wadsworth (1984)"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.3758\/BRM.41.1.113","volume":"41","author":"A Cao","year":"2009","unstructured":"Cao, A., Chintamani, K.K., Pandya, A.K., Ellis, R.D.: NASA TLX: software for assessing subjective mental workload. Behav. Res. Meth. 41(1), 113\u2013117 (2009). https:\/\/doi.org\/10.3758\/BRM.41.1.113","journal-title":"Behav. Res. Meth."},{"key":"33_CR6","unstructured":"Castin, L., Fr\u00e9nay, B.: Clustering with decision trees: divisive and agglomerative approach. In: ESANN, pp. 455\u2013460 (2018)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Chen, J., et al.: Interpretable clustering via discriminative rectangle mixture model. In: ICDM, pp. 823\u2013828. IEEE Computer Society (2016)","DOI":"10.1109\/ICDM.2016.0097"},{"issue":"2","key":"33_CR8","doi-asserted-by":"publisher","first-page":"930","DOI":"10.1016\/j.ejor.2005.04.029","volume":"174","author":"Y Chen","year":"2006","unstructured":"Chen, Y., Hsu, W., Lee, Y.: TASC: two-attribute-set clustering through decision tree construction. Eur. J. Oper. Res. 174(2), 930\u2013944 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"33_CR9","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Vassilvitskii, S.: Fair clustering through fairlets. In: NIPS, pp. 5029\u20135037 (2017)"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Freund, Y.: Random projection trees and low dimensional manifolds. In: STOC, pp. 537\u2013546. ACM (2008)","DOI":"10.1145\/1374376.1374452"},{"key":"33_CR11","unstructured":"Dasgupta, S., Frost, N., Moshkovitz, M., Rashtchian, C.: Explainable k-means clustering: theory and practice. In: XXAI Workshop. ICML (2020)"},{"key":"33_CR12","first-page":"1","volume":"7","author":"J Demsar","year":"2006","unstructured":"Demsar, J.: Statistical comparisons of classifiers. JMLR 7, 1\u201330 (2006)","journal-title":"JMLR"},{"key":"33_CR13","unstructured":"Escofier, B., et al.: Analyses factorielles simples et multiples. Dunod 284 (1998)"},{"issue":"383","key":"33_CR14","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1080\/01621459.1983.10478008","volume":"78","author":"EB Fowlkes","year":"1983","unstructured":"Fowlkes, E.B., Mallows, C.L.: A method for comparing two hierarchical clusterings. J. Am. Stat. Assoc. 78(383), 553\u2013569 (1983)","journal-title":"J. Am. Stat. Assoc."},{"issue":"2","key":"33_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s11634-013-0129-3","volume":"7","author":"R Fraiman","year":"2013","unstructured":"Fraiman, R., Ghattas, B., Svarc, M.: Interpretable clustering using unsupervised binary trees. Adv. Data Anal. Classif. 7(2), 125\u2013145 (2013)","journal-title":"Adv. Data Anal. Classif."},{"key":"33_CR16","unstructured":"Freund, Y., et al.: Learning the structure of manifolds using random projections. In: NIPS, pp. 473\u2013480. Curran Associates, Inc. (2007)"},{"key":"33_CR17","unstructured":"Frost, N., Moshkovitz, M., Rashtchian, C.: ExKMC: expanding explainable k-means clustering. CoRR abs\/2006.02399 (2020)"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Gabidolla, M., Carreira-Perpi\u00f1\u00e1n, M.\u00c1.: Optimal interpretable clustering using oblique decision trees. In: KDD, pp. 400\u2013410. ACM (2022)","DOI":"10.1145\/3534678.3539361"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.patcog.2017.01.031","volume":"67","author":"B Ghattas","year":"2017","unstructured":"Ghattas, B., Michel, P., Boyer, L.: Clustering nominal data using unsupervised binary decision trees. Pattern Recognit. 67, 177\u2013185 (2017)","journal-title":"Pattern Recognit."},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Greenacre, M., et al.: Multiple correspondence analysis. CRC (2006)","DOI":"10.1201\/9781420011319"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Guidotti, R., et al.: Clustering individual transactional data for masses of users. In: KDD, pp. 195\u2013204. ACM (2017)","DOI":"10.1145\/3097983.3098034"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Guidotti, R., et al.: A survey of methods for explaining black box models. ACM CSUR 51(5), 93:1\u201393:42 (2019)","DOI":"10.1145\/3236009"},{"key":"33_CR23","first-page":"70","volume":"82","author":"AE Guti\u00e9rrez-Rodr\u00edguez","year":"2015","unstructured":"Guti\u00e9rrez-Rodr\u00edguez, A.E., et al.: Mining patterns for clustering on numerical datasets using unsupervised decision trees. KBS 82, 70\u201379 (2015)","journal-title":"KBS"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Holzinger, A., et al.: Measuring the quality of explanations: the system causability scale (SCS) comparing human and machine explanations. KI 34(2), 193\u2013198 (2020)","DOI":"10.1007\/s13218-020-00636-z"},{"issue":"4","key":"33_CR25","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/320941.320947","volume":"5","author":"AS Householder","year":"1958","unstructured":"Householder, A.S.: Unitary triangularization of a nonsymmetric matrix. J. ACM 5(4), 339\u2013342 (1958)","journal-title":"J. ACM"},{"key":"33_CR26","unstructured":"Laber, E.S., Murtinho, L.: On the price of explainability for some clustering problems. In: ICML, vol. 139, pp. 5915\u20135925. PMLR (2021)"},{"key":"33_CR27","doi-asserted-by":"publisher","first-page":"109239","DOI":"10.1016\/j.patcog.2022.109239","volume":"137","author":"ES Laber","year":"2023","unstructured":"Laber, E.S., Murtinho, L., Oliveira, F.: Shallow decision trees for explainable k-means clustering. Pattern Recognit. 137, 109239 (2023)","journal-title":"Pattern Recognit."},{"key":"33_CR28","doi-asserted-by":"crossref","unstructured":"Lawless, C., et al.: Interpretable clustering via multi-polytope machines. In: AAAI, pp. 7309\u20137316. AAAI Press (2022)","DOI":"10.1609\/aaai.v36i7.20693"},{"key":"33_CR29","doi-asserted-by":"crossref","unstructured":"Liu, B., Xia, Y., Yu, P.S.: Clustering through decision tree construction. In: CIKM, pp. 20\u201329. ACM (2000)","DOI":"10.1145\/354756.354775"},{"key":"33_CR30","doi-asserted-by":"publisher","first-page":"52370","DOI":"10.1109\/ACCESS.2020.2980581","volume":"8","author":"O Loyola-Gonz\u00e1lez","year":"2020","unstructured":"Loyola-Gonz\u00e1lez, O., et al.: An explainable artificial intelligence model for clustering numerical databases. IEEE Access 8, 52370\u201352384 (2020)","journal-title":"IEEE Access"},{"key":"33_CR31","unstructured":"McCartin-Lim, M., McGregor, A., Wang, R.: Approximate principal direction trees. In: ICML. icml.cc\/Omnipress (2012)"},{"key":"33_CR32","volume-title":"Design and Analysis of Experiments","author":"DC Montgomery","year":"2017","unstructured":"Montgomery, D.C.: Design and Analysis of Experiments. Wiley, Hoboken (2017)"},{"key":"33_CR33","unstructured":"Moshkovitz, M., Dasgupta, S., Rashtchian, C., Frost, N.: Explainable k-means and k-medians clustering. In: ICML, vol. 119, pp. 7055\u20137065. PMLR (2020)"},{"key":"33_CR34","unstructured":"Nguyen, X.V., et al.: Information theoretic measures for clusterings comparison: is a correction for chance necessary? In: ICML, vol. 382, pp. 73\u201380. ACM (2009)"},{"key":"33_CR35","unstructured":"Pelleg, D., Moore, A.W.: X-means: extending k-means with efficient estimation of the number of clusters. In: ICML, pp. 727\u2013734. Morgan Kaufmann (2000)"},{"key":"33_CR36","doi-asserted-by":"crossref","unstructured":"Plant, C., B\u00f6hm, C.: INCONCO: interpretable clustering of numerical and categorical objects. In: KDD, pp. 1127\u20131135. ACM (2011)","DOI":"10.1145\/2020408.2020584"},{"issue":"1","key":"33_CR37","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF00116251","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81\u2013106 (1986)","journal-title":"Mach. Learn."},{"issue":"336","key":"33_CR38","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846\u2013850 (1971)","journal-title":"J. Am. Stat. Assoc."},{"key":"33_CR39","volume-title":"Introduction to Data Mining","author":"PN Tan","year":"2016","unstructured":"Tan, P.N., et al.: Introduction to Data Mining. Pearson Education India, Noida (2016)"},{"issue":"5","key":"33_CR40","doi-asserted-by":"publisher","first-page":"5239","DOI":"10.1007\/s11227-020-03436-2","volume":"77","author":"P Tavallali","year":"2021","unstructured":"Tavallali, P., Tavallali, P., Singhal, M.: K-means tree: an optimal clustering tree for unsupervised learning. J. Supercomput. 77(5), 5239\u20135266 (2021)","journal-title":"J. Supercomput."},{"issue":"1","key":"33_CR41","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.dss.2005.01.008","volume":"42","author":"S Thomassey","year":"2006","unstructured":"Thomassey, S., Fiordaliso, A.: A hybrid sales forecasting system based on clustering and decision trees. Decis. Support Syst. 42(1), 408\u2013421 (2006)","journal-title":"Decis. Support Syst."},{"key":"33_CR42","unstructured":"Verma, N., Kpotufe, S., Dasgupta, S.: Which spatial partition trees are adaptive to intrinsic dimension? In: UAI, pp. 565\u2013574. AUAI Press (2009)"},{"key":"33_CR43","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.csda.2015.11.006","volume":"96","author":"DC Wickramarachchi","year":"2016","unstructured":"Wickramarachchi, D.C., Robertson, B.L., Reale, M., Price, C.J., Brown, J.: HHCART: an oblique decision tree. Comput. Stat. Data Anal. 96, 12\u201323 (2016)","journal-title":"Comput. Stat. Data Anal."}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45275-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:07:10Z","timestamp":1710256030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45275-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031452741","9783031452758"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45275-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"8 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Discovery Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dis2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ds2023.inesctec.pt\/","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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"133","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":"37","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":"10","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":"28% - 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","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}