Dimensionality Reduction

Module overview

The Decomposition module reduces feature dimensions while preserving useful signal for visualization, denoising, compression, and downstream modeling. These algorithms are often used before clustering, classification, or charting when raw feature spaces are too large or too noisy.

This module is a strong fit when:

• you need lower-dimensional inputs for charts or interactive analysis
• you want to compress features before training another model
• you need different strategies for dense versus sparse matrices

JavaScript implementation

@kanaries/ml provides decomposition algorithms directly in JavaScript and TypeScript so frontend and full-stack teams can run feature compression in the same runtime that already owns embeddings, visualizations, or data pipelines. This is especially useful when dimensionality reduction is part of a browser-based analytics experience or a Node.js preprocessing step.

If someone searches for "PCA in JavaScript" or "Truncated SVD in TypeScript", this module is the right entry point.

Quick navigation

• PCA: dense feature compression and variance-preserving projections
• Sparse PCA: more interpretable sparse components
• Truncated SVD: latent factors for sparse or vectorized inputs

Detailed module guide

How to choose an algorithm

1. Use PCA for dense numeric features when variance preservation matters most.
2. Use Truncated SVD for sparse matrices such as TF-IDF or one-hot vectors.
3. Use Sparse PCA when component interpretability matters alongside dimensionality reduction.

JavaScript deployment notes

• Standardize dense continuous features before PCA-style methods when appropriate.
• Use decomposition to simplify data before charting, clustering, or supervised learning.
• In browser apps, dimensionality reduction is often most valuable when it feeds directly into interactive visualizations.