{"title":"High-Performance Visualization of Multi-Dimensional Gene Expression Data","authors":"M. Trutschl, P. Kilgore, U. Cvek","doi":"10.1109/ICNC.2012.20","DOIUrl":null,"url":null,"abstract":"Previous application of Kohonen's self organizing map to common visualizations has yielded promising results. In this research, we extend the classic two-dimensional scatter plot visualization algorithm into the third dimension by permitting competition to occur within a three-dimensional search space. This approach takes advantage of spatial memory and increases the intrinsic dimensionality of a widely used visualization technique. We also present a method of parallelizing this novel algorithm as a method of overcoming the runtime complexity associated with it using MPI. We note that this algorithm responds extremely well to parallelization and that it leads to an effective method for knowledge discovery in complex multidimensional datasets.","PeriodicalId":442973,"journal":{"name":"2012 Third International Conference on Networking and Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Networking and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNC.2012.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Previous application of Kohonen's self organizing map to common visualizations has yielded promising results. In this research, we extend the classic two-dimensional scatter plot visualization algorithm into the third dimension by permitting competition to occur within a three-dimensional search space. This approach takes advantage of spatial memory and increases the intrinsic dimensionality of a widely used visualization technique. We also present a method of parallelizing this novel algorithm as a method of overcoming the runtime complexity associated with it using MPI. We note that this algorithm responds extremely well to parallelization and that it leads to an effective method for knowledge discovery in complex multidimensional datasets.