{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,9]],"date-time":"2026-10-09T12:04:03Z","timestamp":1791547443482,"version":"4.3.4"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T00:00:00Z","timestamp":1587772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T00:00:00Z","timestamp":1587772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003065","name":"University of Vienna","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100003065","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Most clustering algorithms have been designed only for pure numerical or pure categorical data sets, while nowadays many applications generate mixed data. It raises the question how to integrate various types of attributes so that one could efficiently group objects without loss of information. It is already well understood that a simple conversion of categorical attributes into a numerical domain is not sufficient since relationships between values such as a certain order are artificially introduced. Leveraging the natural conceptual hierarchy among categorical information, concept trees summarize the categorical attributes. In this paper, we introduce the algorithm<jats:italic>ClicoT<\/jats:italic>(<jats:bold>CL<\/jats:bold>ustering mixed-type data<jats:bold>I<\/jats:bold>ncluding<jats:bold>CO<\/jats:bold>ncept<jats:bold>T<\/jats:bold>rees) as reported by Behzadi et al. (Advances in Knowledge Discovery and Data Mining, Springer, Cham, 2019) which is based on the minimum description length principle. Profiting of the conceptual hierarchies, ClicoT integrates categorical and numerical attributes by means of a MDL-based objective function. The result of ClicoT is well interpretable since concept trees provide insights into categorical data. Extensive experiments on synthetic and real data sets illustrate that ClicoT is noise-robust and yields well-interpretable results in a short runtime. Moreover, we investigate the impact of concept hierarchies as well as various data characteristics in this paper.<\/jats:p>","DOI":"10.1007\/s41060-020-00216-2","type":"journal-article","created":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T03:57:30Z","timestamp":1587787050000},"page":"233-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Clustering of mixed-type data considering concept hierarchies: problem specification and algorithm"],"prefix":"10.1007","volume":"10","author":[{"given":"Sahar","family":"Behzadi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikola S.","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claudia","family":"Plant","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"B\u00f6hm","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,25]]},"reference":[{"key":"216_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.datak.2007.03.016","volume":"63","author":"A Ahmad","year":"2007","unstructured":"Ahmad, A., Dey, L.: A k-mean clustering algorithm for mixed numeric and categorical data. Data Knowl. Eng. 63, 503\u2013527 (2007)","journal-title":"Data Knowl. Eng."},{"key":"216_CR2","doi-asserted-by":"crossref","unstructured":"Behzadi, S., Ibrahim, M.A., Plant, C.: Parameter free mixed-type density-based clustering. In: Database and Expert Systems Applications (DEXA) (2018)","DOI":"10.1007\/978-3-319-98812-2_2"},{"key":"216_CR3","doi-asserted-by":"crossref","unstructured":"Behzadi, S., M\u00fcller, N.S., Plant, C., B\u00f6hm, C.: Clustering of mixed-type data considering concept hierarchies. In: Advances in Knowledge Discovery and Data Mining, pp. 555\u2013573. Springer International Publishing, Cham (2019)","DOI":"10.1007\/978-3-030-16148-4_43"},{"key":"216_CR4","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Faloutsos, C., Pan, J., Plant, C.: Robust information-theoretic clustering. In: KDD (2006)","DOI":"10.1145\/1150402.1150414"},{"key":"216_CR5","doi-asserted-by":"crossref","unstructured":"B\u00f6hm, C., Goebl, S., Oswald, A., Plant, C., Plavinski, M., Wackersreuther, B.: Integrative parameter-free clustering of data with mixed type attributes. In: PAKDD (1), pp. 38\u201347 (2010)","DOI":"10.1007\/978-3-642-13657-3_7"},{"issue":"1","key":"216_CR6","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1016\/j.patcog.2011.07.006","volume":"45","author":"G David","year":"2012","unstructured":"David, G., Averbuch, A.: Spectralcat: categorical spectral clustering of numerical and nominal data. Pattern Recognit. 45(1), 416\u2013433 (2012)","journal-title":"Pattern Recognit."},{"key":"216_CR7","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository (2010). http:\/\/archive.ics.uci.edu\/ml"},{"key":"216_CR8","unstructured":"He, Z., Xu, X., Deng, S.: Clustering mixed numeric and categorical data: a cluster ensemble approach. CoRR arXiv:cs\/0509011 (2005)"},{"issue":"20","key":"216_CR9","doi-asserted-by":"publisher","first-page":"4474","DOI":"10.1016\/j.ins.2007.05.003","volume":"177","author":"CC Hsu","year":"2007","unstructured":"Hsu, C.C., Chen, C.L., Su, Y.W.: Hierarchical clustering of mixed data based on distance hierarchy. Inf. Sci. 177(20), 4474\u20134492 (2007)","journal-title":"Inf. Sci."},{"issue":"1","key":"216_CR10","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.eswa.2005.11.017","volume":"32","author":"CC Hsu","year":"2007","unstructured":"Hsu, C.C., Chen, Y.C.: Mining of mixed data with application to catalog marketing. Expert Syst. Appl. 32(1), 12\u201323 (2007)","journal-title":"Expert Syst. Appl."},{"key":"216_CR11","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1009769707641","volume":"2","author":"Z Huang","year":"1998","unstructured":"Huang, Z.: Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Min. Knowl. Discov. 2, 283\u2013304 (1998)","journal-title":"Data Min. Knowl. Discov."},{"key":"216_CR12","doi-asserted-by":"crossref","unstructured":"Jian, S., Hu, L., Cao, L., Lu, K.: Metric-based auto-instructor for learning mixed data representation (2018)","DOI":"10.1609\/aaai.v32i1.11597"},{"issue":"2","key":"216_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11634-016-0238-x","volume":"10","author":"D Mcparland","year":"2016","unstructured":"Mcparland, D., Gormley, I.C.: Model based clustering for mixed data: ClustMD. Adv. Data Anal. Classif. 10(2), 155\u2013169 (2016)","journal-title":"Adv. Data Anal. Classif."},{"key":"216_CR14","doi-asserted-by":"crossref","unstructured":"Plant, C., B\u00f6hm, C.: Inconco: interpretable clustering of numerical and categorical objects. In: KDD, pp. 1127\u20131135 (2011)","DOI":"10.1145\/2020408.2020584"},{"key":"216_CR15","unstructured":"Rajan, V., Bhattacharya, S.: Dependency clustering of mixed data with gaussian mixture copulas. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI\u201916, pp. 1967\u20131973. AAAI Press (2016)"},{"issue":"2","key":"216_CR16","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J Rissanen","year":"1983","unstructured":"Rissanen, J.: A universal prior for integers and estimation by minimum description length. Ann. Stat. 11(2), 416\u201331 (1983)","journal-title":"Ann. Stat."},{"key":"216_CR17","doi-asserted-by":"crossref","unstructured":"Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: is a correction for chance necessary? In: ICML (2009)","DOI":"10.1145\/1553374.1553511"},{"key":"216_CR18","doi-asserted-by":"crossref","unstructured":"Wang, C., Chi, C.H., Zhou, W., Wong, R.: Coupled interdependent attribute analysis on mixed data. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI\u201915, p. 1861\u20131867. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9480"},{"key":"216_CR19","doi-asserted-by":"crossref","unstructured":"Yin, J., Tan, Z.: Clustering mixed type attributes in large dataset. In: ISPA, pp. 655\u2013661 (2005)","DOI":"10.1007\/11576235_66"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-020-00216-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-020-00216-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-020-00216-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,22]],"date-time":"2022-10-22T08:03:07Z","timestamp":1666425787000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-020-00216-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,25]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["216"],"URL":"https:\/\/doi.org\/10.1007\/s41060-020-00216-2","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,25]]},"assertion":[{"value":"8 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}