Search Results for author: David Uminsky

Found 5 papers, 0 papers with code

LUMAWIG: Un-bottling the bottleneck distance for zero dimensional persistence diagrams at scale

no code implementations NeurIPS Workshop TDA_and_Beyond 2020 Paul Samuel Ignacio, Jay-Anne Bulauan, David Uminsky

We present LUMÁWIG, a novel efficient algorithm to compute dimension zero bottleneck distance between two persistence diagrams of a specific kind which outperforms all other publicly available algorithm in runtime and accuracy.

The Problem with Metrics is a Fundamental Problem for AI

no code implementations20 Feb 2020 Rachel Thomas, David Uminsky

Optimizing a given metric is a central aspect of most current AI approaches, yet overemphasizing metrics leads to manipulation, gaming, a myopic focus on short-term goals, and other unexpected negative consequences.

Classification of Single-lead Electrocardiograms: TDA Informed Machine Learning

no code implementations25 Nov 2019 Paul Samuel Ignacio, David Uminsky, Christopher Dunstan, Esteban Escobar, Luke Trujillo

Atrial Fibrillation is a heart condition characterized by erratic heart rhythms caused by chaotic propagation of electrical impulses in the atria, leading to numerous health complications.

BIG-bench Machine Learning Classification +1

Multiclass Total Variation Clustering

no code implementations NeurIPS 2013 Xavier Bresson, Thomas Laurent, David Uminsky, James H. von Brecht

Ideas from the image processing literature have recently motivated a new set of clustering algorithms that rely on the concept of total variation.

Clustering

Convergence and Energy Landscape for Cheeger Cut Clustering

no code implementations NeurIPS 2012 Xavier Bresson, Thomas Laurent, David Uminsky, James V. Brecht

Unsupervised clustering of scattered, noisy and high-dimensional data points is an important and difficult problem.

Clustering

Cannot find the paper you are looking for? You can Submit a new open access paper.