The Value of Manifold Learning Algorithms in Simplifying Complex Datasets for More Efficacious Analysis
Keywords:Manifold learning, principal component analysis, Isomap
Advances in manifold learning have proven to be of great benefit in reducing the dimensionality of large complex datasets. Elements in an intricate dataset will typically belong in high-dimensional space as the number of individual features or independent variables will be extensive. However, these elements can be integrated into a low-dimensional manifold with well-defined parameters. By constructing a low-dimensional manifold and embedding it into high-dimensional feature space, the dataset can be simplified for easier interpretation. In spite of this elemental dimensionality reduction, the dataset’s constituents do not lose any information, but rather filter it with the hopes of elucidating the appropriate knowledge. This paper will explore the importance of this method of data analysis, its applications, and its extensions into topological data analysis.
How to Cite
Copyright (c) 2020 Sciential - McMaster Undergraduate Science Journal
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Authors submitting to the journal must adhere to the terms of Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) license as outlined below:
1. You are free to share (copy and redistribute) any material from this journal, granted you have given appropriate credit, provided the link to the license, and indicated whether changes were applied to original work.
2. You are free to adapt (remix, transform, and build upon) any material from this journal, granted you distribute your work under the same license.