Sparse clusterability: testing for cluster structure in high dimensions

1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Background: Cluster analysis is utilized frequently in scientific theory and applications to separate data into groups. A key assumption in many clustering algorithms is that the data was generated from a population consisting of multiple distinct clusters. Clusterability testing allows users to question the inherent assumption of latent cluster structure, a theoretical requirement for meaningful results in cluster analysis. Results: This paper proposes methods for clusterability testing designed for high-dimensional data by utilizing sparse principal component analysis. Type I error and power of the clusterability tests are evaluated using simulated data with different types of cluster structure in high dimensions. Empirical performance of the new methods is evaluated and compared with prior methods on gene expression, microarray, and shotgun proteomics data. Our methods had reasonably low Type I error and maintained power for many datasets with a variety of structures and dimensions. Cluster structure was not detectable in other datasets with spatially close clusters. Conclusion: This is the first analysis of clusterability testing on both simulated and real-world high-dimensional data.

Cite

CITATION STYLE

APA

Laborde, J., Stewart, P. A., Chen, Z., Chen, Y. A., & Brownstein, N. C. (2023). Sparse clusterability: testing for cluster structure in high dimensions. BMC Bioinformatics, 24(1). https://doi.org/10.1186/s12859-023-05210-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free