BMC Bioinformatics | |
2D–EM clustering approach for high-dimensional data through folding feature vectors | |
Research | |
Piotr J. Kamola1  Alok Sharma2  Tatsuhiko Tsunoda3  | |
[1] Center for Integrative Medical Sciences, RIKEN Yokohama, 230-0045, Yokohama, Japan;CREST, JST, 230-0045, Yokohama, Japan;Center for Integrative Medical Sciences, RIKEN Yokohama, 230-0045, Yokohama, Japan;CREST, JST, 230-0045, Yokohama, Japan;Institute for Integrated and Intelligent Systems, Griffith University, 170 Kessels Rd, 4111, Nathan, QLD, Australia;School of Engineering and Physics, University of the South Pacific, Laucala Bay Rd, Suva, Fiji;Center for Integrative Medical Sciences, RIKEN Yokohama, 230-0045, Yokohama, Japan;CREST, JST, 230-0045, Yokohama, Japan;Medical Research Institute, Tokyo Medical and Dental University, 113-8510, Tokyo, Japan; | |
关键词: EM algorithm; Feature matrix; Small sample size; Transcriptome; Methylome; Cancer; Phenotype clustering; | |
DOI : 10.1186/s12859-017-1970-8 | |
来源: Springer | |
【 摘 要 】
BackgroundClustering 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.ResultsWe 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.ConclusionsThe 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/).
【 授权许可】
CC BY
© The Author(s). 2017
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO202311106151759ZK.pdf | 1559KB | download | |
Fig. 2 | 223KB | Image | download |
Fig. 2 | 326KB | Image | download |
Table 1 | 87KB | Table | download |
12944_2017_533_Article_IEq2.gif | 1KB | Image | download |
Fig. 3 | 191KB | Image | download |
MediaObjects/13046_2023_2865_MOESM5_ESM.tif | 16266KB | Other | download |
MediaObjects/41408_2023_931_MOESM1_ESM.docx | 75KB | Other | download |
Fig. 4 | 393KB | Image | download |
Fig. 4 | 1257KB | Image | download |
Fig. 1 | 2894KB | Image | download |
Table 2 | 149KB | Table | download |
40708_2023_205_Article_IEq12.gif | 1KB | Image | download |
MediaObjects/12888_2023_5290_MOESM1_ESM.docx | 17KB | Other | download |
Fig. 1 | 110KB | Image | download |
【 图 表 】
Fig. 1
40708_2023_205_Article_IEq12.gif
Fig. 1
Fig. 4
Fig. 4
Fig. 3
12944_2017_533_Article_IEq2.gif
Fig. 2
Fig. 2
【 参考文献 】
- [1]
- [2]
- [3]
- [4]
- [5]
- [6]
- [7]
- [8]
- [9]
- [10]
- [11]
- [12]
- [13]
- [14]
- [15]
- [16]
- [17]
- [18]
- [19]
- [20]
- [21]
- [22]
- [23]
- [24]
- [25]
- [26]
- [27]
- [28]
- [29]
- [30]
- [31]
- [32]
- [33]
- [34]
- [35]
- [36]
- [37]
- [38]
- [39]
- [40]
- [41]
- [42]
- [43]
- [44]
- [45]
- [46]
- [47]
- [48]
- [49]
- [50]
- [51]
- [52]
- [53]
- [54]
- [55]
- [56]
- [57]
- [58]
- [59]
- [60]
- [61]
- [62]
- [63]
- [64]
- [65]
- [66]
- [67]
- [68]
- [69]
- [70]
- [71]
- [72]
- [73]
- [74]
- [75]
- [76]
- [77]
- [78]