{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T15:47:34Z","timestamp":1773676054921,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T00:00:00Z","timestamp":1473897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T00:00:00Z","timestamp":1473897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS-1120404"],"award-info":[{"award-number":["DMS-1120404"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["DMS-1120404"],"award-info":[{"award-number":["DMS-1120404"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title><jats:sec>\n                <jats:title>Background<\/jats:title>\n                <jats:p>Clustering is a widely used collection of unsupervised learning techniques for identifying natural classes within a data set. It is often used in bioinformatics to infer population substructure. Genomic data are often categorical and high dimensional, e.g., long sequences of nucleotides. This makes inference challenging: The distance metric is often not well-defined on categorical data; running time for computations using high dimensional data can be considerable; and the Curse of Dimensionality often impedes the interpretation of the results. Up to the present, however, the literature and software addressing clustering for categorical data has not yet led to a standard approach.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Results<\/jats:title>\n                <jats:p>We present software for an ensemble method that performs well in comparison with other methods regardless of the dimensionality of the data. In an ensemble method a variety of instantiations of a statistical object are found and then combined into a consensus value. It has been known for decades that ensembling generally outperforms the components that comprise it in many settings. Here, we apply this ensembling principle to clustering.<\/jats:p>\n                <jats:p>We begin by generating many hierarchical clusterings with different clustering sizes. When the dimension of the data is high, we also randomly select subspaces also of variable size, to generate clusterings. Then, we combine these clusterings into a single membership matrix and use this to obtain a new, ensembled dissimilarity matrix using Hamming distance.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Conclusions<\/jats:title>\n                <jats:p>Ensemble clustering, as implemented in  and called , gives more clearly separated clusters than other clustering techniques for categorical data. The latest version with manual and examples is available at <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/jlp2duke\/EnsCat\">https:\/\/github.com\/jlp2duke\/EnsCat<\/jats:ext-link>.<\/jats:p>\n              <\/jats:sec>","DOI":"10.1186\/s12859-016-1245-9","type":"journal-article","created":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T13:10:31Z","timestamp":1473945031000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["EnsCat: clustering of categorical data via ensembling"],"prefix":"10.1186","volume":"17","author":[{"given":"Bertrand S.","family":"Clarke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saeid","family":"Amiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2723-7249","authenticated-orcid":false,"given":"Jennifer L.","family":"Clarke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,15]]},"reference":[{"key":"1245_CR1","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 v-means algorithm for clustering large data sets with categorical values. Data Min Knowl Disc. 1998; 2:283\u2013304.","journal-title":"Data Min Knowl Disc"},{"issue":"2","key":"1245_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02616237","volume":"8","author":"G Celeux","year":"1991","unstructured":"Celeux G, Govaert G. Clustering criteria for discrete data and latent class models. J Classif. 1991; 8(2):157\u201376.","journal-title":"J Classif"},{"issue":"5","key":"1245_CR3","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/S0306-4379(00)00022-3","volume":"25","author":"S Guha","year":"2000","unstructured":"Guha S, Rastogi R, Shim K. ROCK: A robust clustering algorithm for categorical attributes. Inf Syst. 2000; 25(5):345\u201366.","journal-title":"Inf Syst"},{"issue":"1","key":"1245_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.datak.2006.01.005","volume":"60","author":"M Zaki","year":"2007","unstructured":"Zaki M, Peters M, Assent I, Seidl T. Click: An effective algorithm for mining subspace clusters in categorical datasets. Data Knowl Eng. 2007; 60(1):51\u201370.","journal-title":"Data Knowl Eng"},{"issue":"12","key":"1245_CR5","doi-asserted-by":"publisher","first-page":"1866","DOI":"10.1109\/TPAMI.2005.237","volume":"27","author":"A Topchy","year":"2005","unstructured":"Topchy A, Jain A, Punch W. Clustering ensembles: Models of consensus and weak partitions. Pattern Anal Mach Intell. 2005; 27(12):1866\u201381.","journal-title":"Pattern Anal Mach Intell"},{"key":"1245_CR6","doi-asserted-by":"publisher","first-page":"1572","DOI":"10.1093\/bioinformatics\/btq170","volume":"26","author":"M Wilkerson","year":"2010","unstructured":"Wilkerson M, Hayes D. Consensusclusterplus: a class discovery tool with confidence assessments and item tracking. Bioinformatics. 2010; 26:1572\u20133.","journal-title":"Bioinformatics"},{"key":"1245_CR7","unstructured":"Amiri S, Clarke J, Clarke B. Clustering categorical data via ensembling dissimilarity matrices. 2015. http:\/\/arxiv.org\/abs\/1506.07930. Accessed 12 Sept 2016."},{"key":"1245_CR8","volume-title":"Lecture Notes in Statistics","author":"E Tabakis","year":"1996","unstructured":"Tabakis E. Robust Statistics, Data Analysis, and Computer Intensive Methods: In Honor of Peter Huber\u2019s 60th Birthday In: Rieder H, editor. Lecture Notes in Statistics. New York: Springer: 1996. p. 375\u201389."},{"issue":"9","key":"1245_CR9","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1093\/bioinformatics\/17.9.763","volume":"17","author":"K Yeung","year":"2001","unstructured":"Yeung K, Ruzzo W. Principal component analysis for clustering gene expression data. Bioinformatics. 2001; 17(9):763\u201374.","journal-title":"Bioinformatics"},{"key":"1245_CR10","volume-title":"R: A Language and Environment for Statistical Computing","author":"R Core Team","year":"2016","unstructured":"R Core Team. R: A Language and Environment for Statistical Computing. Vienna: R Foundation for Statistical Computing; 2016. R Foundation for Statistical Computing. http:\/\/www.R-project.org. Accessed 12 Sept 2016."},{"issue":"1","key":"1245_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L. Random forests. Mach Learn. 2001; 45(1):5\u201332.","journal-title":"Mach Learn"},{"key":"1245_CR12","unstructured":"United States Maritime Administration. MARAD open data portal \u2013 maritime data and statistics, u.s.-flag privately-owned fleet (as of 3\/3\/2016). PhD thesis, United States Department of Transportation. 2016. http:\/\/marad.dot.gov\/resources\/data-statistics\/. Accessed 25 Mar 2016."},{"key":"1245_CR13","unstructured":"Amiri S, Clarke B, Clarke J, Koepke H. A general hybrid clustering technique. 2015. http:\/\/arxiv.org\/abs\/1503.01183. Accessed 12 Sept 2016."},{"key":"1245_CR14","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.csda.2006.11.025","volume":"52","author":"C Hennig","year":"2007","unstructured":"Hennig C. Cluster-wise assessment of cluster stability. Comput Stat Data Anal. 2007; 52:258\u201371.","journal-title":"Comput Stat Data Anal"},{"issue":"D1","key":"1245_CR15","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1093\/nar\/gkr859","volume":"40","author":"BE Pickett","year":"2012","unstructured":"Pickett BE, Sadat EL, Zhang Y, Noronha JM, Squires RB, Hunt V, Liu M, Kumar S, Zaremba S, Gu Z, Zhou L, Larson CN, Dietrich J, Klem EB, Scheuermann RH. ViPR: an open bioinformatics database and analysis resource for virology research. Nuc Acids Res. 2012; 40(D1):593\u20138. Accessed 27 Apr 2015.","journal-title":"Nuc Acids Res"},{"issue":"4","key":"1245_CR16","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1093\/molbev\/mst010","volume":"30","author":"K Katoh","year":"2013","unstructured":"Katoh K, Standley D. MAFFT multiple sequence alignment software version 7: improvements in performance and usability. Mol Biol Evol. 2013; 30(4):772\u201380. Accessed 2 Mar 2015.","journal-title":"Mol Biol Evol"},{"key":"1245_CR17","doi-asserted-by":"publisher","unstructured":"Galili T. dendextend: an r package for visualizing, adjusting, and comparing trees of hierarchical clustering. Bioinformatics. 2015. doi:10.1093\/bioinformatics\/btv428. http:\/\/bioinformatics.oxfordjournals.org\/content\/31\/22\/3718.full.pdf+html.","DOI":"10.1093\/bioinformatics\/btv428"},{"key":"1245_CR18","doi-asserted-by":"crossref","unstructured":"Beyer K, Goldstein R, Ramakrishnan R, Shaft U. When is \u2018nearest neighbor\u2019 meaningful?. In: Proceedings of the 7th International Conference on Database Theory: 1999. p. 217\u201335.","DOI":"10.1007\/3-540-49257-7_15"},{"issue":"1","key":"1245_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1002\/sam.10095","volume":"4","author":"H Koepke","year":"2011","unstructured":"Koepke H, Clarke B. On the limits of clustering in high dimensions via cost functions. Stat Anal Data Mining. 2011; 4(1):30\u201353.","journal-title":"Stat Anal Data Mining"},{"key":"1245_CR20","unstructured":"Breiman L. Bagging predictors. Technical Report No. 421, Department of Statistics, University of California Berkley. 1994."},{"issue":"9","key":"1245_CR21","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1093\/bioinformatics\/17.9.763","volume":"17","author":"K Yeung","year":"2001","unstructured":"Yeung K, Ruzzo W. Principal component analysis for clustering gene expression data. Bioinformatics. 2001; 17(9):763\u201374.","journal-title":"Bioinformatics"},{"issue":"3","key":"1245_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.2307\/2347949","volume":"32","author":"W Chang","year":"1983","unstructured":"Chang W. On using principal components before separating a mixture of two multivariate normal distributions. Appl Stat. 1983; 32(3):267\u201375.","journal-title":"Appl Stat"},{"key":"1245_CR23","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1198\/jasa.2010.tm09415","volume":"105","author":"D Witten","year":"2010","unstructured":"Witten D, Tibshirani R. A framework for feature selection in clustering. J Amer Stat Assoc. 2010; 105:713\u201326.","journal-title":"J Amer Stat Assoc"},{"key":"1245_CR24","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1111\/j.1467-9868.2004.02059.x","volume":"66","author":"J Friedman","year":"2004","unstructured":"Friedman J, Meulman J. Clustering objects on subsets of attributes. J Roy Stat Soc Ser B. 2004; 66:815\u201349.","journal-title":"J Roy Stat Soc Ser B"},{"issue":"2","key":"1245_CR25","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00357-004-0015-y","volume":"21","author":"F Murtagh","year":"2004","unstructured":"Murtagh F. On ultrametricity, data coding, and computation. J Class. 2004; 21(2):167\u201384.","journal-title":"J Class"},{"issue":"12","key":"1245_CR26","doi-asserted-by":"publisher","first-page":"2843","DOI":"10.1016\/j.patcog.2011.04.024","volume":"44","author":"L Bai","year":"2011","unstructured":"Bai L, Liang J, Dang C, Cao F. A novel attribute weighting algorithm for clustering high-dimensional categorical data. Pattern Recogn. 2011; 44(12):2843\u201361.","journal-title":"Pattern Recogn"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-016-1245-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-016-1245-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-016-1245-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T18:02:10Z","timestamp":1706810530000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-016-1245-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,15]]},"references-count":26,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,12]]}},"alternative-id":["1245"],"URL":"https:\/\/doi.org\/10.1186\/s12859-016-1245-9","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,15]]},"assertion":[{"value":"21 May 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"380"}}