k-Simplex Volume Optimizing Projection Algorithms for High-Dimensional Data Sets
Many applications produce data sets that contain hundreds or thousands of features, and consequently sit in very high dimensional space.It is desirable for purposes of analysis to reduce the dimension in a way that preserves certain important properties. Previous work has established conditions necessary for projecting data into lower dimensions while preserving pairwise distances up to some tolerance threshold, and algorithms have been developed to do so optimally. However, although similar criteria for projecting data into lower dimensions while preserving k-simplex volumes has been established, ...
(For more, see "View full record.")