Full metadata record
DC FieldValueLanguage
dc.contributor.authorTzeng, Jengnanen_US
dc.contributor.authorLu, Henry Horng-Shingen_US
dc.contributor.authorLi, Wen-Hsiungen_US
dc.date.accessioned2014-12-08T15:12:19Z-
dc.date.available2014-12-08T15:12:19Z-
dc.date.issued2008-04-04en_US
dc.identifier.issn1471-2105en_US
dc.identifier.urihttp://dx.doi.org/10.1186/1471-2105-9-179en_US
dc.identifier.urihttp://hdl.handle.net/11536/9472-
dc.description.abstractBackground: Multi-dimensional scaling (MDS) is aimed to represent high dimensional data in a low dimensional space with preservation of the similarities between data points. This reduction in dimensionality is crucial for analyzing and revealing the genuine structure hidden in the data. For noisy data, dimension reduction can effectively reduce the effect of noise on the embedded structure. For large data set, dimension reduction can effectively reduce information retrieval complexity. Thus, MDS techniques are used in many applications of data mining and gene network research. However, although there have been a number of studies that applied MDS techniques to genomics research, the number of analyzed data points was restricted by the high computational complexity of MDS. In general, a non-metric MDS method is faster than a metric MDS, but it does not preserve the true relationships. The computational complexity of most metric MDS methods is over O(N(2)), so that it is difficult to process a data set of a large number of genes N, such as in the case of whole genome microarray data. Results: We developed a new rapid metric MDS method with a low computational complexity, making metric MDS applicable for large data sets. Computer simulation showed that the new method of split-and-combine MDS (SC-MDS) is fast, accurate and efficient. Our empirical studies using microarray data on the yeast cell cycle showed that the performance of K-means in the reduced dimensional space is similar to or slightly better than that of K-means in the original space, but about three times faster to obtain the clustering results. Our clustering results using SC-MDS are more stable than those in the original space. Hence, the proposed SC-MDS is useful for analyzing whole genome data. Conclusion: Our new method reduces the computational complexity from O(N(3)) to O(N) when the dimension of the feature space is far less than the number of genes N, and it successfully reconstructs the low dimensional representation as does the classical MDS. Its performance depends on the grouping method and the minimal number of the intersection points between groups. Feasible methods for grouping methods are suggested; each group must contain both neighboring and far apart data points. Our method can represent high dimensional large data set in a low dimensional space not only efficiently but also effectively.en_US
dc.language.isoen_USen_US
dc.titleMultidimensional scaling for large genomic data setsen_US
dc.typeArticleen_US
dc.identifier.doi10.1186/1471-2105-9-179en_US
dc.identifier.journalBMC BIOINFORMATICSen_US
dc.citation.volume9en_US
dc.citation.issueen_US
dc.citation.epageen_US
dc.contributor.department統計學研究所zh_TW
dc.contributor.departmentInstitute of Statisticsen_US
dc.identifier.wosnumberWOS:000255284500001-
dc.citation.woscount21-
Appears in Collections:Articles


Files in This Item:

  1. 000255284500001.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.