Optimal clustering with missing values

Abstract

Background Missing values frequently arise in modern biomedical studies due to various reasons, including missing tests or complex profiling technologies for different omics measurements. Missing values can complicate the application of clustering algorithms, whose goals are to group points based on some similarity criterion. A common practice for dealing with missing values in the context of clustering is to first impute the missing values, and then apply the clustering algorithm on the completed data. Results We consider missing values in the context of optimal clustering, which finds an optimal clustering operator with reference to an underlying random labeled point process (RLPP). We show how the missing-value problem fits neatly into the overall framework of optimal clustering by incorporating the missing value mechanism into the random labeled point process and then marginalizing out the missing-value process. In particular, we demonstrate the proposed framework for the Gaussian model with arbitrary covariance structures. Comprehensive experimental studies on both synthetic and real-world RNA-seq data show the superior performance of the proposed optimal clustering with missing values when compared to various clustering approaches. Conclusion Optimal clustering with missing values obviates the need for imputation-based pre-processing of the data, while at the same time possessing smaller clustering errors. Electronic supplementary material The online version of this article (10.1186/s12859-019-2832-3) contains supplementary material, which is available to authorized users.

Clustering with missing and left‐censored data: A simulation study comparing multiple‐imputation‐based procedures

“…We used a standard imputation‐followed‐by‐clustering approach, and it could be argued that neither the filter (imputation) nor the decision (clustering) were optimal. Recent work proposed a model‐based optimal clustering approach for data from microarrays and RNA sequencing (RNA‐seq) by incorporating the missing value mechanism into a random labeled point process and then marginalizing out the missing value process from Boluki, Dadaneh, Qian, and Dougherty (2019). However, it assumes that the data are MCAR.…”

Smart City Ranking System: A Supporting Tool to Manage Migration Trends for Australian Cities

“…The idea of clustering involves grouping similar data set which can then be used to address the missing vales [78]. A simple type of clustering is "imputation" where missing values are either replaces with zero or average values of row/column [78][79][80].…”

Selected research articles from the 2018 International Workshop on Computational Network Biology: Modeling, Analysis, and Control (CNB-MAC)

“…After the workshop, eleven papers [1][2][3][4][5][6][7][8][9][10][11] were accepted for publication in the CNB-MAC 2018 partner journals: BMC Bioinformatics and BMC Genomics. In the following we provide a brief summary of these selected papers.…”

“…Missing values can complicate the application of clustering algorithms, whose goal is to group data points based on some similarity criterion. In [2], Boluki et al consider missing values in the context of optimal clustering, which finds an optimal clustering operator with reference to an underlying random labeled point process. They incorporate the missing value mechanism into the random labeled point process, and obtain the optimal clustering operator by marginalizing out the missing-value process.…”