AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Reduction Algorithms for Persistence Diagrams of Networks: CoralTDA and PrunIT

Cuneyt Gurcan Akcora, Murat Kantarcioglu, Yulia Gel, Baris Coskunuzer

NeurIPS 2022 · Graph learning › Graph algorithms and clustering · approach: Graph distance and retrieval · 1 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Prune dominated vertices before persistence computationPrunIT · Email-Enroncomputation time (sec), step size 4: 7014 -> 1412Improved
Prune dominated vertices before persistence computationPrunIT · Email-Enroncomputation time (sec), step size 12: 2520 -> 513Improved
Prune dominated vertices before persistence computationPrunIT · Email-Enronsimplex count (million), step size 4: 465.2 -> 270.2Improved
Prune dominated vertices before persistence computationPrunIT · Email-Enronsimplex count (million), step size 12: 155.8 -> 90.7Improved
Apply PrunIT to the 1-hop ego networksOGB-ARXIV · OGB-ARXIV 1-hop ego networks0-dimensional persistence computation time reduction: 37%Improved
Apply PrunIT to the 1-hop ego networksOGB-MAG · OGB-MAG 1-hop ego networks0-dimensional persistence computation time reduction: 23%Improved
Use CoralTDA core reductionCoralTDA · FACEBOOK and TWITTERcomputation time reductionHurt
Use CoralTDA core reductionCoralTDA · OHSUcomputation time reduction: at most 25%Improved
Use PrunIT dominated-vertex reductionPrunIT · FIRSTMM and SYNNEWvertex reduction: less than 10%Hurt
Use PrunIT dominated-vertex reductionPrunIT · Other graph-classification datasetsvertex reduction: at least 35%Improved
Use CoralTDA to reduce the graph to the (k+1)-coreCoralTDA · Graph and node classification datasets, higher-dimensional persistencevertex reduction: 25%-75%Improved
Use CoralTDA to reduce the graph to the (k+1)-coreCoralTDA · 10 graph and node classification datasets, k=4 and k=5vertex reduction: 100%Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy