Papers › Learning metrics for persistence-based summaries and applications for graph classification

Learning metrics for persistence-based summaries and applications for graph classification

27 Apr 2019arXiv:1904.12189links table onlyarchive 2025-07-28

Qi Zhao, Yusu Wang

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Recently a new feature representation and data analysis methodology based on a topological tool called persistent homology (and its corresponding persistence diagram summary) has started to attract momentum. A series of methods have been developed to map a persistence diagram to a vector representation so as to facilitate the downstream use of machine learning tools, and in these approaches, the importance (weight) of different persistence features are often preset. However often in practice, the choice of the weight function should depend on the nature of the specific type of data one considers, and it is thus highly desirable to learn a best weight function (and thus metric for persistence diagrams) from labelled data. We study this problem and develop a new weighted kernel, called WKPI, for persistence summaries, as well as an optimization framework to learn a good metric for persistence summaries. Both our kernel and optimization problem have nice properties. We further apply the learned kernel to the challenging task of graph classification, and show that our WKPI-based classification framework obtains similar or (sometimes significantly) better results than the best results from a range of previous graph classification frameworks on a collection of benchmark datasets.

PaperPDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

topology474/WKPI officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Classification D&D WKPI-kmeans Accuracy 82.0% #8 of 53 Archive leaderboard report
Graph Classification IMDb-B WKPI-kcenters Accuracy 75.4% #22 of 51 Archive leaderboard report
Graph Classification IMDb-M WKPI-kcenters Accuracy 49.5% #28 of 36 Archive leaderboard report
Graph Classification MUTAG WKPI-kcenters Accuracy 87.5% #46 of 74 Archive leaderboard report
Graph Classification NCI1 WKPI-kmeans Accuracy 87.2% #3 of 69 Archive leaderboard report
Graph Classification NCI109 WKPI-kcenters Accuracy 87.3 #1 of 38 Archive leaderboard report
Graph Classification NEURON-Average WKPI-kcenters Accuracy 77.80 #1 of 5 Archive leaderboard report
Graph Classification NEURON-Average WKPI-kmeans Accuracy 73.50 #2 of 5 Archive leaderboard report
Graph Classification NEURON-BINARY WKPI-kmeans Accuracy 90.3 #1 of 5 Archive leaderboard report
Graph Classification NEURON-BINARY WKPI-kcenters Accuracy 86.5 #2 of 5 Archive leaderboard report
Graph Classification NEURON-MULTI WKPI-kcenters Accuracy 69.1 #1 of 5 Archive leaderboard report
Graph Classification NEURON-MULTI WKPI-kmeans Accuracy 56.2 #3 of 5 Archive leaderboard report
Graph Classification PROTEINS WKPI-kmeans Accuracy 78.8% #15 of 103 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections