Name
Abstract | ||
|---|---|---|
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(N2), 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.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.Our new method reduces the computational complexity from O(N3) 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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1186/1471-2105-9-179 | BMC Bioinformatics |
Keywords | Field | DocType |
microarrays,dimension reduction,bioinformatics,computational complexity,k means,microarray data,sequence alignment,cell cycle,gene network,multi dimensional scaling,dna,feature space,computer simulation,multidimensional scaling,empirical study,algorithms,information retrieval,data mining,database management systems,high dimensional data | Data point,Data mining,Singular value decomposition,Data set,Clustering high-dimensional data,Dimensionality reduction,Multidimensional scaling,Computer science,Curse of dimensionality,Theoretical computer science,Bioinformatics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
9 | 1 | 1471-2105 |
Citations | PageRank | References |
44 | 1.73 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jengnan Tzeng | 1 | 75 | 5.46 |
| H. H.-S. Lu | 2 | 99 | 13.45 |
| Wen-Hsiung Li | 3 | 336 | 24.03 |