Ellipsoid fitting with the Cayley transform

04/20/2023
by   Omar Melikechi, et al.
0

We introduce an algorithm, Cayley transform ellipsoid fitting (CTEF), that uses the Cayley transform to fit ellipsoids to noisy data in any dimension. Unlike many ellipsoid fitting methods, CTEF is ellipsoid specific – meaning it always returns elliptic solutions – and can fit arbitrary ellipsoids. It also outperforms other fitting methods when data are not uniformly distributed over the surface of an ellipsoid. Inspired by calls for interpretable and reproducible methods in machine learning, we apply CTEF to dimension reduction, data visualization, and clustering. Since CTEF captures global curvature, it is able to extract nonlinear features in data that other methods fail to identify. This is illustrated in the context of dimension reduction on human cell cycle data, and in the context of clustering on classical toy examples. In the latter case, CTEF outperforms 10 popular clustering algorithms.

READ FULL TEXT
research
10/19/2022

Comparing Exploratory Graphical Analyses and Unique Variable Analysis to Other Dimension Reduction Methods On Machine Learning Algorithms

Developing interpretable machine learning models has become an increasin...
research
07/13/2016

Fitting a Simplicial Complex using a Variation of k-means

We give a simple and effective two stage algorithm for approximating a p...
research
08/03/2018

Robust Regression for Automatic Fusion Plasma Analysis based on Generative Modeling

The first step to realize automatic experimental data analysis for fusio...
research
02/27/2020

The Effectiveness of Johnson-Lindenstrauss Transform for High Dimensional Optimization with Outliers

Johnson-Lindenstrauss (JL) Transform is one of the most popular methods ...
research
12/22/2017

Mixtures of Matrix Variate Bilinear Factor Analyzers

Over the years data is becoming increasingly higher dimensional, which h...
research
09/15/2016

Recursive nearest agglomeration (ReNA): fast clustering for approximation of structured signals

-In this work, we revisit fast dimension reduction approaches, as with r...
research
02/16/2018

Parameter-free Network Sparsification and Data Reduction by Minimal Algorithmic Information Loss

The study of large and complex datasets, or big data, organized as netwo...

Please sign up or login with your details

Forgot password? Click here to reset