2D–EM clustering approach for high-dimensional data through folding feature vectors

Abstract Background Clustering methods are becoming widely utilized in biomedical research where the volume and complexity of data is rapidly increasing. Unsupervised clustering of patient information can reveal distinct phenotype groups with different underlying mechanism, risk prognosis and treatm...

Full description

Bibliographic Details
Main Authors: Alok Sharma, Piotr J. Kamola, Tatsuhiko Tsunoda
Format: Article
Language:English
Published: BMC 2017-12-01
Series:BMC Bioinformatics
Subjects:
Online Access:http://link.springer.com/article/10.1186/s12859-017-1970-8
id doaj-b8d4c5a6e74f4d88991967c2fc1f55fe
record_format Article
spelling doaj-b8d4c5a6e74f4d88991967c2fc1f55fe2020-11-24T21:59:46ZengBMCBMC Bioinformatics1471-21052017-12-0118S1619520910.1186/s12859-017-1970-82D–EM clustering approach for high-dimensional data through folding feature vectorsAlok Sharma0Piotr J. Kamola1Tatsuhiko Tsunoda2Center for Integrative Medical Sciences, RIKEN YokohamaCenter for Integrative Medical Sciences, RIKEN YokohamaCenter for Integrative Medical Sciences, RIKEN YokohamaAbstract Background Clustering methods are becoming widely utilized in biomedical research where the volume and complexity of data is rapidly increasing. Unsupervised clustering of patient information can reveal distinct phenotype groups with different underlying mechanism, risk prognosis and treatment response. However, biological datasets are usually characterized by a combination of low sample number and very high dimensionality, something that is not adequately addressed by current algorithms. While the performance of the methods is satisfactory for low dimensional data, increasing number of features results in either deterioration of accuracy or inability to cluster. To tackle these challenges, new methodologies designed specifically for such data are needed. Results We present 2D–EM, a clustering algorithm approach designed for small sample size and high-dimensional datasets. To employ information corresponding to data distribution and facilitate visualization, the sample is folded into its two-dimension (2D) matrix form (or feature matrix). The maximum likelihood estimate is then estimated using a modified expectation-maximization (EM) algorithm. The 2D–EM methodology was benchmarked against several existing clustering methods using 6 medically-relevant transcriptome datasets. The percentage improvement of Rand score and adjusted Rand index compared to the best performing alternative method is up to 21.9% and 155.6%, respectively. To present the general utility of the 2D–EM method we also employed 2 methylome datasets, again showing superior performance relative to established methods. Conclusions The 2D–EM algorithm was able to reproduce the groups in transcriptome and methylome data with high accuracy. This build confidence in the methods ability to uncover novel disease subtypes in new datasets. The design of 2D–EM algorithm enables it to handle a diverse set of challenging biomedical dataset and cluster with higher accuracy than established methods. MATLAB implementation of the tool can be freely accessed online ( http://www.riken.jp/en/research/labs/ims/med_sci_math or http://www.alok-ai-lab.com /).http://link.springer.com/article/10.1186/s12859-017-1970-8EM algorithmFeature matrixSmall sample sizeTranscriptomeMethylomeCancer
collection DOAJ
language English
format Article
sources DOAJ
author Alok Sharma
Piotr J. Kamola
Tatsuhiko Tsunoda
spellingShingle Alok Sharma
Piotr J. Kamola
Tatsuhiko Tsunoda
2D–EM clustering approach for high-dimensional data through folding feature vectors
BMC Bioinformatics
EM algorithm
Feature matrix
Small sample size
Transcriptome
Methylome
Cancer
author_facet Alok Sharma
Piotr J. Kamola
Tatsuhiko Tsunoda
author_sort Alok Sharma
title 2D–EM clustering approach for high-dimensional data through folding feature vectors
title_short 2D–EM clustering approach for high-dimensional data through folding feature vectors
title_full 2D–EM clustering approach for high-dimensional data through folding feature vectors
title_fullStr 2D–EM clustering approach for high-dimensional data through folding feature vectors
title_full_unstemmed 2D–EM clustering approach for high-dimensional data through folding feature vectors
title_sort 2d–em clustering approach for high-dimensional data through folding feature vectors
publisher BMC
series BMC Bioinformatics
issn 1471-2105
publishDate 2017-12-01
description Abstract Background Clustering methods are becoming widely utilized in biomedical research where the volume and complexity of data is rapidly increasing. Unsupervised clustering of patient information can reveal distinct phenotype groups with different underlying mechanism, risk prognosis and treatment response. However, biological datasets are usually characterized by a combination of low sample number and very high dimensionality, something that is not adequately addressed by current algorithms. While the performance of the methods is satisfactory for low dimensional data, increasing number of features results in either deterioration of accuracy or inability to cluster. To tackle these challenges, new methodologies designed specifically for such data are needed. Results We present 2D–EM, a clustering algorithm approach designed for small sample size and high-dimensional datasets. To employ information corresponding to data distribution and facilitate visualization, the sample is folded into its two-dimension (2D) matrix form (or feature matrix). The maximum likelihood estimate is then estimated using a modified expectation-maximization (EM) algorithm. The 2D–EM methodology was benchmarked against several existing clustering methods using 6 medically-relevant transcriptome datasets. The percentage improvement of Rand score and adjusted Rand index compared to the best performing alternative method is up to 21.9% and 155.6%, respectively. To present the general utility of the 2D–EM method we also employed 2 methylome datasets, again showing superior performance relative to established methods. Conclusions The 2D–EM algorithm was able to reproduce the groups in transcriptome and methylome data with high accuracy. This build confidence in the methods ability to uncover novel disease subtypes in new datasets. The design of 2D–EM algorithm enables it to handle a diverse set of challenging biomedical dataset and cluster with higher accuracy than established methods. MATLAB implementation of the tool can be freely accessed online ( http://www.riken.jp/en/research/labs/ims/med_sci_math or http://www.alok-ai-lab.com /).
topic EM algorithm
Feature matrix
Small sample size
Transcriptome
Methylome
Cancer
url http://link.springer.com/article/10.1186/s12859-017-1970-8
work_keys_str_mv AT aloksharma 2demclusteringapproachforhighdimensionaldatathroughfoldingfeaturevectors
AT piotrjkamola 2demclusteringapproachforhighdimensionaldatathroughfoldingfeaturevectors
AT tatsuhikotsunoda 2demclusteringapproachforhighdimensionaldatathroughfoldingfeaturevectors
_version_ 1725847202109063168