.

Dimensionality reduction


Reading time: less than 1 minute

A lot of times, our data has lots of features. But a lot of these features are correlated with each other in linear and non-linear ways. Dimensionality reduction allows us to represent the same “information” using less dimensions.

This is useful because it gets rid of redundancy.

One thing commonly done with dimensionality reduction algorithms is reducing to 2 or 3 dimensions. With 2 or 3 dimensions, we can directly visualize stuff by plotting everything. This makes it easy to see how different data points relate to each other, how many clusters there might be, and how easy it is to separate data from different classes.

Techniques

The following pages link here

Citation

If you find this work useful, please cite it as:
@article{yaltirakli,
  title   = "Dimensionality reduction",
  author  = "Yaltirakli, Gokberk",
  journal = "gkbrk.com",
  year    = "2025",
  url     = "https://www.gkbrk.com/dimensionality-reduction"
}
Not using BibTeX? Click here for more citation styles.
IEEE Citation
Gokberk Yaltirakli, "Dimensionality reduction", August, 2025. [Online]. Available: https://www.gkbrk.com/dimensionality-reduction. [Accessed Aug. 16, 2025].
APA Style
Yaltirakli, G. (2025, August 16). Dimensionality reduction. https://www.gkbrk.com/dimensionality-reduction
Bluebook Style
Gokberk Yaltirakli, Dimensionality reduction, GKBRK.COM (Aug. 16, 2025), https://www.gkbrk.com/dimensionality-reduction

Comments

© 2025 Gokberk Yaltirakli