Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Matthew Burfitt

dblp:242/9340 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning paradigms · 33% Graph learning · 33% Probabilistic and Bayesian machine learning · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning
clustering
0.412020
A Numerical Measure of the Instability of Mapper-Type Algorithms · J. Mach. Learn. Res. 2020
Machine learning › Graph learning
topological data analysis
0.412020
A Numerical Measure of the Instability of Mapper-Type Algorithms · J. Mach. Learn. Res. 2020
Machine learning › Learning paradigms
unsupervised learning
0.412020
A Numerical Measure of the Instability of Mapper-Type Algorithms · J. Mach. Learn. Res. 2020

Methods — techniques the papers use, named apart from their topics

mapper algorithm · 0.4clustering · 0.4
YearPublicationVenuePosition
2020 A Numerical Measure of the Instability of Mapper-Type Algorithms
abstract
Mapper is an unsupervised machine learning algorithm generalising the notion of clustering to obtain a geometric description of a dataset. The procedure splits the data into possibly overlapping bins which are then clustered. The output of the algorithm is a graph where nodes represent clusters and edges represent the sharing of data points between two clusters. However, several parameters must be selected before applying Mapper and the resulting graph may vary dramatically with the choice of parameters. We define an intrinsic notion of Mapper instability that measures the variability of the output as a function of the choice of parameters required to construct a Mapper output. Our results and discussion are general and apply to all Mapper-type algorithms. We derive theoretical results that provide estimates for the instability and suggest practical ways to control it. We provide also experiments to illustrate our results and in particular we demonstrate that a reliable candidate Mapper output can be identified as a local minimum of instability regarded as a function of Mapper input parameters.
Francisco Belchí Guillamón, Jacek Brodzki, Matthew Burfitt, Mahesan Niranjan
J. Mach. Learn. Res.3