Statistical Analysis and Parameter Selection for Mapper

06/01/2017
by   Mathieu Carrière, et al.
0

In this article, we study the question of the statistical convergence of the 1-dimensional Mapper to its continuous analogue, the Reeb graph. We show that the Mapper is an optimal estimator of the Reeb graph, which gives, as a byproduct, a method to automatically tune its parameters and compute confidence regions on its topological features, such as its loops and flares. This allows to circumvent the issue of testing a large grid of parameters and keeping the most stable ones in the brute-force setting, which is widely used in visualization, clustering and feature selection with the Mapper.

READ FULL TEXT
research
10/16/2020

Feature Selection for Huge Data via Minipatch Learning

Feature selection often leads to increased model interpretability, faste...
research
07/05/2020

Block Model Guided Unsupervised Feature Selection

Feature selection is a core area of data mining with a recent innovation...
research
11/08/2018

Spectral Simplicial Theory for Feature Selection and Applications to Genomics

The scale and complexity of modern data sets and the limitations associa...
research
10/09/2020

Nonnegative Spectral Analysis with Adaptive Graph and L_2,0-Norm Regularization for Unsupervised Feature Selection

Feature selection is an important data preprocessing in data mining and ...
research
08/28/2021

Feature Selection in High-dimensional Space Using Graph-Based Methods

High-dimensional feature selection is a central problem in a variety of ...
research
10/08/2021

TopoDetect: Framework for Topological Features Detection in Graph Embeddings

TopoDetect is a Python package that allows the user to investigate if im...
research
10/26/2016

A self-tuning Firefly algorithm to tune the parameters of Ant Colony System (ACSFA)

Ant colony system (ACS) is a promising approach which has been widely us...

Please sign up or login with your details

Forgot password? Click here to reset