{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T10:51:21Z","timestamp":1769597481215,"version":"3.49.0"},"reference-count":27,"publisher":"Oxford University Press (OUP)","issue":"22","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,11,15]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Motivation: Clustering methods can be useful for automatically grouping documents into meaningful clusters, improving human comprehension of a document collection. Although there are clustering algorithms that can achieve the goal for relatively large document collections, they do not always work well for small and homogenous datasets.<\/jats:p><jats:p>Methods: In this article, we present Retro\u2014a novel clustering algorithm that extracts meaningful clusters along with concise and descriptive titles from small and homogenous document collections. Unlike common clustering approaches, our algorithm predicts cluster titles before clustering. It relies on the hypergeometric distribution model to discover key phrases, and generates candidate clusters by assigning documents to these phrases. Further, the statistical significance of candidate clusters is tested using supervised learning methods, and a multiple testing correction technique is used to control the overall quality of clustering.<\/jats:p><jats:p>Results: We test our system on five disease datasets from OMIM \u00ae and evaluate the results based on MeSH \u00ae term assignments. We further compare our method with several baseline and state-of-the-art methods, including K-means, expectation maximization, latent Dirichlet allocation-based clustering, Lingo, OPTIMSRC and adapted GK-means. The experimental results on the 20-Newsgroup and ODP-239 collections demonstrate that our method is successful at extracting significant clusters and is superior to existing methods in terms of quality of clusters. Finally, we apply our system to a collection of 6248 topical sets from the HomoloGene \u00ae database, a resource in PubMed \u00ae . Empirical evaluation confirms the method is useful for small homogenous datasets in producing meaningful clusters with descriptive titles.<\/jats:p><jats:p>Availability and implementation: A web-based demonstration of the algorithm applied to a collection of sets from the HomoloGene database is available at http:\/\/www.ncbi.nlm.nih.gov\/CBBresearch\/Wilbur\/IRET\/CLUSTERING_HOMOLOGENE\/index.html .<\/jats:p><jats:p>Contact: \u00a0lana.yeganova@nih.gov<\/jats:p><jats:p>Supplementary Information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btu514","type":"journal-article","created":{"date-parts":[[2014,7,30]],"date-time":"2014-07-30T00:14:11Z","timestamp":1406679251000},"page":"3240-3248","source":"Crossref","is-referenced-by-count":15,"title":["Retro: concept-based clustering of biomedical topical sets"],"prefix":"10.1093","volume":"30","author":[{"given":"Lana","family":"Yeganova","sequence":"first","affiliation":[{"name":"National Center for Biotechnology Information, National Library of Medicine, NIH, 8600 Rockville Pike, Bethesda, MD 20894, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Won","family":"Kim","sequence":"additional","affiliation":[{"name":"National Center for Biotechnology Information, National Library of Medicine, NIH, 8600 Rockville Pike, Bethesda, MD 20894, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sun","family":"Kim","sequence":"additional","affiliation":[{"name":"National Center for Biotechnology Information, National Library of Medicine, NIH, 8600 Rockville Pike, Bethesda, MD 20894, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. John","family":"Wilbur","sequence":"additional","affiliation":[{"name":"National Center for Biotechnology Information, National Library of Medicine, NIH, 8600 Rockville Pike, Bethesda, MD 20894, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2014,7,29]]},"reference":[{"key":"2023012712003498400_btu514-B1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-3223-4_4","article-title":"A survey of text clustering algorithms","volume-title":"Mining Text Data","author":"Aggarwal","year":"2012"},{"key":"2023012712003498400_btu514-B2","article-title":"Document clustering: the next frontier","volume-title":"Data Clustering: Algorithms and Applications","author":"Anastasiu","year":"2013"},{"key":"2023012712003498400_btu514-B3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1111\/j.2517-6161.1995.tb02031.x","article-title":"Controlling the false discovery rate: a practical and powerful approach to multiple testing","volume":"57","author":"Benjamini","year":"1995","journal-title":"Journal of the Royal Statistical Society"},{"key":"2023012712003498400_btu514-B4","first-page":"993","article-title":"Latent dirichlet allocation","volume":"3","author":"Blei","year":"2003","journal-title":"Journal of Machine Learning Research"},{"key":"2023012712003498400_btu514-B5","doi-asserted-by":"crossref","first-page":"2964","DOI":"10.1016\/j.cor.2007.01.005","article-title":"Biclustering in data mining","volume":"35","author":"Busygin","year":"2008","journal-title":"Computers and Operations Res."},{"key":"2023012712003498400_btu514-B6","first-page":"170","article-title":"Optimal meta search results clustering","volume-title":"Proceedings of the 33rd Annual ACM SIGIR Conference","author":"Carpineto","year":"2010"},{"key":"2023012712003498400_btu514-B7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-1-4757-4305-0_3","article-title":"Simultaneous clustering and dynamic keyword weighting for text documents","volume-title":"Survey of Text Mining","author":"Frigui","year":"2004"},{"key":"2023012712003498400_btu514-B8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Scienceand Computational Biology","author":"Gusfield","year":"1997"},{"key":"2023012712003498400_btu514-B9","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1656274.1656278","article-title":"The WEKA data mining software: an update","volume":"11","author":"Hall","year":"2009","journal-title":"SIGKDD Explor."},{"key":"2023012712003498400_btu514-B10","first-page":"682","article-title":"The cluster-abstraction model: unsupervised learning of topic hierarchies from text data","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"Hofmann","year":"1999"},{"key":"2023012712003498400_btu514-B11","doi-asserted-by":"crossref","first-page":"2767","DOI":"10.1093\/bioinformatics\/btq459","article-title":"Click-words: learning to predict document keywords from a user perspective","volume":"26","author":"Islamaj Do\u011fan","year":"2010","journal-title":"Bioinformatics"},{"key":"2023012712003498400_btu514-B12","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","article-title":"Data clustering: a review","volume":"31","author":"Jain","year":"1999","journal-title":"ACM Comput. Surveys"},{"key":"2023012712003498400_btu514-B13","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1016\/j.jbi.2012.05.005","article-title":"Identifying well-formed biomedical phrases in MEDLINE \u00ae text","volume":"45","author":"Kim","year":"2012","journal-title":"J. Biomed. Inform."},{"key":"2023012712003498400_btu514-B14","volume-title":"Introduction to Probability Theory and Statistical Inference","author":"Larson","year":"1982"},{"key":"2023012712003498400_btu514-B15","first-page":"218","article-title":"Document clustering via adaptive subspace iteration","volume-title":"Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Li","year":"2004"},{"key":"2023012712003498400_btu514-B16","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10791-010-9141-9","article-title":"Investigating task performance of probabilistic topic models: an empirical study of PLSA and LDA","volume":"14","author":"Lu","year":"2011","journal-title":"Inform. Retrieval"},{"key":"2023012712003498400_btu514-B17","volume-title":"MALLET: A Machine Learning for Language Toolkit","author":"McCallum","year":"2002"},{"key":"2023012712003498400_btu514-B18","article-title":"Post-retrieval clustering using third-order similarity measures","volume-title":"Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics","author":"Moreno","year":"2013"},{"key":"2023012712003498400_btu514-B19","first-page":"359","article-title":"Lingo: search results clustering algorithm based on singular value decomposition","author":"Osinski","year":"2004","journal-title":"Intell. Inform. Syste. Adv. Soft Comput."},{"key":"2023012712003498400_btu514-B20","doi-asserted-by":"crossref","DOI":"10.1006\/jcss.2000.1711","article-title":"Latent semantic indexing: a probabilistic analysis","author":"Papadimitriou","year":"2000"},{"key":"2023012712003498400_btu514-B21"},{"key":"2023012712003498400_btu514-B22","first-page":"986","article-title":"Text clustering based on key phrases","volume-title":"The 1st International Conference on Information Science and Engineering, ICISE 2009","author":"Wang","year":"2009"},{"key":"2023012712003498400_btu514-B23","first-page":"386","article-title":"A thematic analysis of the AIDS literature","volume":"7","author":"Wilbur","year":"2002","journal-title":"Proc. Pac. Symp. Biocomput."},{"key":"2023012712003498400_btu514-B24","first-page":"694","article-title":"Integrating document clustering and topic modeling","volume-title":"Proceedings of Conference on Uncertainty in Artificial Intelligence","author":"Xie","year":"2013"},{"key":"2023012712003498400_btu514-B25","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","article-title":"Survey of clustering algorithms","volume":"16","author":"Xu","year":"2005","journal-title":"IEEE Trans. Neural Netw."},{"key":"2023012712003498400_btu514-B26","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1002\/asi.20979","article-title":"How to interpret PubMed queries and why it matters","volume":"60","author":"Yeganova","year":"2009","journal-title":"J. Am. Soc. Inform. Sci."},{"key":"2023012712003498400_btu514-B27","first-page":"46","article-title":"Web document clustering: a feasibility demonstration","volume-title":"Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'98)","author":"Zamir","year":"1998"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/22\/3240\/48931260\/bioinformatics_30_22_3240.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/22\/3240\/48931260\/bioinformatics_30_22_3240.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T16:38:18Z","timestamp":1717173498000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/30\/22\/3240\/2390599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,29]]},"references-count":27,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2014,11,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btu514","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2014,11,15]]},"published":{"date-parts":[[2014,7,29]]}}}