MergeTreeClustering Class Reference

#include <MergeTreeClustering.h>

Detailed Description

Author

Mathieu Pont (mathi.nosp@m.eu.p.nosp@m.ont@l.nosp@m.ip6..nosp@m.fr)

Date

2021.

This module defines the MergeTreeClustering class that computes a clustering of an ensemble of merge trees in k clusters It is actually a version of KMeans (dynamic clustering algorithm) where centroids are merge trees

Related publication
"Wasserstein Distances, Geodesics and Barycenters of Merge Trees"
Mathieu Pont, Jules Vidal, Julie Delon, Julien Tierny.
Proc. of IEEE VIS 2021.
IEEE Transactions on Visualization and Computer Graphics, 2021

Online examples:

• Merge Tree Clustering example
  
• Merge Tree Principal Geodesic Analysis example
  
• Merge Tree Wasserstein Auto-Encoder example
  

---

The documentation for this class was generated from the following file:

• /home/julien/Pro/git/github/ttk-tierny/core/base/mergeTreeClustering/MergeTreeClustering.h