{"title":"A general approach for similarity-based linear projections using a genetic algorithm","authors":"James Mouradian, B. Hamann, R. Rosenbaum","doi":"10.1117/12.909485","DOIUrl":null,"url":null,"abstract":"A widely applicable approach to visualizing properties of high-dimensional data is to view the data as a linear \nprojection into two- or three-dimensional space. However, developing an appropriate linear projection is often \ndifficult. Information can be lost during the projection process, and many linear projection methods only apply \nto a narrow range of qualities the data may exhibit. We propose a general-purpose genetic algorithm to develop \nlinear projections of high-dimensional data sets which preserve a specified quality of the data set as much as \npossible. The obtained results show that the algorithm converges quickly and reliably for a variety of different \ndata sets.","PeriodicalId":89305,"journal":{"name":"Visualization and data analysis","volume":"20 1","pages":"82940L"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Visualization and data analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.909485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
A widely applicable approach to visualizing properties of high-dimensional data is to view the data as a linear
projection into two- or three-dimensional space. However, developing an appropriate linear projection is often
difficult. Information can be lost during the projection process, and many linear projection methods only apply
to a narrow range of qualities the data may exhibit. We propose a general-purpose genetic algorithm to develop
linear projections of high-dimensional data sets which preserve a specified quality of the data set as much as
possible. The obtained results show that the algorithm converges quickly and reliably for a variety of different
data sets.