Jaccard Filtration and Stable Paths in the Mapper

06/19/2019
by   Dustin L. Arendt, et al.
0

The contributions of this paper are two-fold. We define a new filtration called the cover filtration built from a single cover based on a generalized Jaccard distance. We provide stability results for the cover filtration and show how the construction is equivalent to the Cech filtration under certain settings. We then develop a language and theory for stable paths within this filtration, inspired by ideas of persistent homology. We demonstrate how the filtration and paths can be applied to a variety of applications in which defining a metric is not obvious but a cover is readily available. We demonstrate the usefulness of this construction by employing it in the context of recommendation systems and explainable machine learning. We demonstrate a new perspective for modeling recommendation system data sets that does not require manufacturing a bespoke metric. This extends work on graph-based recommendation systems, allowing a topological perspective. For an explicit example, we look at a movies data set and we find the stable paths identified in our framework represent a sequence of movies constituting a gentle transition and ordering from one genre to another. For explainable machine learning, we apply the Mapper for model induction, providing explanations in the form of paths between subpopulations or observations. Our framework provides an alternative way of building a filtration from a single mapper that is then used to explore stable paths. As a direct illustration, we build a mapper from a supervised machine learning model trained on the FashionMNIST data set. We show that the stable paths in the cover filtration provide improved explanations of relationships between subpopulations of images.

READ FULL TEXT

page 17

page 19

research
04/30/2018

Explainable Recommendation: A Survey and New Perspectives

Explainable Recommendation refers to the personalized recommendation alg...
research
07/15/2023

Explainable AI with counterfactual paths

Explainable AI (XAI) is an increasingly important area of research in ma...
research
05/23/2020

Towards Analogy-Based Explanations in Machine Learning

Principles of analogical reasoning have recently been applied in the con...
research
11/30/2022

Internal Closedness and von Neumann-Morgenstern Stability in Matching Theory: Structures and Complexity

Let G be a graph and suppose we are given, for each v ∈ V(G), a strict o...
research
09/11/2022

Reinforcement Recommendation Reasoning through Knowledge Graphs for Explanation Path Quality

Numerous Knowledge Graphs (KGs) are being created to make recommender sy...
research
02/16/2022

Heterogeneous Graph Learning for Explainable Recommendation over Academic Networks

With the explosive growth of new graduates with research degrees every y...
research
02/17/2011

Foundations for Understanding and Building Conscious Systems using Stable Parallel Looped Dynamics

The problem of consciousness faced several challenges for a few reasons:...

Please sign up or login with your details

Forgot password? Click here to reset