Evidence map›Paper›PMID 34708196›Full record

ArticleFrontiers in artificial intelligence2021

Minimal Cycle Representatives in Persistent Homology Using Linear Programming: An Empirical Study With User's Guide.

Lu Li, Connor Thompson, Gregory Henselman-Petrusek, Chad Giusti, Lori Ziegelmeier

Abstract read
In one paragraph

Article in Frontiers in artificial intelligence, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 4 papers.

0numbers the graph read from it
0cells of the map it votes in
4citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

4 citing papers in PubMed.

  1. Article
  2. Article
  3. Homology of homologous knotted proteins.Journal of the Royal Society, Interface · 2023
    Article
  4. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Lu LiMathematics, Statistics, and Computer Science Department, Macalester College, Saint Paul, MN, United States.
Connor ThompsonDepartment of Mathematics, Purdue University, West Lafayette, IN, United States.
Gregory Henselman-PetrusekMathematical Institute, University of Oxford, Oxford, United Kingdom.
Chad GiustiDepartment of Mathematical Sciences, University of Delaware, Newark, DE, United States.
Lori ZiegelmeierMathematics, Statistics, and Computer Science Department, Macalester College, Saint Paul, MN, United States.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Cycle representatives of persistent homology classes can be used to provide descriptions of topological features in data. However, the non-uniqueness of these representatives creates ambiguity and can lead to many different interpretations of the same set of classes. One approach to solving this problem is to optimize the choice of representative against some measure that is meaningful in the context of the data. In this work, we provide a study of the effectiveness and computational cost of several

Indexed as

computational persistent homologygeneratorsl1 and l0 minimizationlinear programmingminimal cycle representativestopological data analysis

Identifiers

PMID34708196
PMCPMC8544243

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.