Optimal bandwidth estimation for a fast manifold learning algorithm to detect circular structure in high-dimensional data

12/28/2016
by   Susovan Pal, et al.
0

We provide a way to infer about existence of topological circularity in high-dimensional data sets in R^d from its projection in R^2 obtained through a fast manifold learning map as a function of the high-dimensional dataset X and a particular choice of a positive real σ known as bandwidth parameter. At the same time we also provide a way to estimate the optimal bandwidth for fast manifold learning in this setting through minimization of these functions of bandwidth. We also provide limit theorems to characterize the behavior of our proposed functions of bandwidth.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2022

A geometric framework for outlier detection in high-dimensional data

Outlier or anomaly detection is an important task in data analysis. We d...
research
11/16/2010

Fast GPGPU Data Rearrangement Kernels using CUDA

Many high performance-computing algorithms are bandwidth limited, hence ...
research
11/18/2020

Randomized Self Organizing Map

We propose a variation of the self organizing map algorithm by consideri...
research
03/09/2016

megaman: Manifold Learning with Millions of points

Manifold Learning is a class of algorithms seeking a low-dimensional non...
research
06/07/2022

An extension to the applicability of adaptive bandwidth choice

In this paper, we extend the applicability of the bandwidth choice metho...
research
07/14/2017

Toward A Scalable Exploratory Framework for Complex High-Dimensional Phenomics Data

Phenomics is an emerging branch of modern biology, which uses high throu...
research
12/19/2016

Feature Encoding in Band-limited Distributed Surveillance Systems

Distributed surveillance systems have become popular in recent years due...

Please sign up or login with your details

Forgot password? Click here to reset