Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2504.09042

A Comprehensive Review of the Mapper Algorithm, a Topological Data Analysis Technique, and Its Applications Across Various Fields (2007-2025)

Vine Nwabuisi Madukpe·Bright Chukwuma Ugoala·Nur Fariha Syaqina Zulkepli
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Mapper algorithm, a technique within topological data analysis (TDA), constructs a simplified graphical representation of high-dimensional data to uncover its underlying shape and structural patterns. The algorithm has attracted significant attention from researchers and has been applied across various disciplines. However, to the best of the authors' knowledge, no comprehensive review currently exists on the Mapper algorithm and its variants as applied across different fields of study between 2007 and 2025. This review addresses this gap and serves as a valuable resource for researchers and practitioners aiming to apply or advance the algorithm. The reviewed literature comprises peer-reviewed articles retrieved from major academic databases, including Google Scholar, Web of Science, Scopus, JSTOR, PubMed, and IEEE Xplore, using the keywords 'topological data analysis,' 'mapper algorithm,' and 'topological graph.' The study further provides an overview and a comparative analysis of the suitability of the most commonly used filter functions and clustering algorithms within the Mapper framework. Additionally, it examines current trends, identifies limitations, and proposes future research directions for the Mapper algorithm and its variants, emphasizing the need for developing effective methodologies to streamline the analysis of high-dimensional data in the age of big data proliferation.

Explore related subjects

math.GN

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vine Nwabuisi Madukpe, Bright Chukwuma Ugoala, Nur Fariha Syaqina Zulkepli. 2025-04-12. A Comprehensive Review of the Mapper Algorithm, a Topological Data Analysis Technique, and Its Applications Across Various Fields (2007-2025). https://arxiv.org/abs/2504.09042

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN↗
arXiv2026

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN↗
arXiv2026

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN↗