Cluster Persistence for Weighted Graphs
Persistent homology is a natural tool for probing the topological characteristics of weighted graphs, essentially focusing on their 0-dimensional homology. While this area has been thoroughly studied, we present a new approach to constructing a filtration for cluster analysis via persistent homology...
Main Authors: | Omer Bobrowski, Primoz Skraba |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-11-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/25/12/1587 |
Similar Items
-
Persistence-based clustering with outlier-removing filtration
by: Alexandre Bois, et al.
Published: (2024-04-01) -
Topics in multidimensional persistence
by: Jacquard, E
Published: (2024) -
Time Series Clustering with Topological and Geometric Mixed Distance
by: Yunsheng Zhang, et al.
Published: (2021-05-01) -
A universal null-distribution for topological data analysis
by: Omer Bobrowski, et al.
Published: (2023-07-01) -
A Novel 2D Clustering Algorithm Based on Recursive Topological Data Structure
by: Ismael Osuna-Galán, et al.
Published: (2022-04-01)