A Notion of Harmonic Clustering in Simplicial Complexes

10/16/2019
by   Stefania Ebli, et al.
0

We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of, graph spectral clustering. The algorithm involves only sparse eigenproblems, and is therefore computationally efficient. We believe that it has broad application as a way to extract features from simplicial complexes that often arise in topological data analysis.

READ FULL TEXT

page 6

page 7

research
11/01/2019

Optimality of Spectral Clustering for Gaussian Mixture Model

Spectral clustering is one of the most popular algorithms to group high ...
research
08/21/2020

KCoreMotif: An Efficient Graph Clustering Algorithm for Large Networks by Exploiting k-core Decomposition and Motifs

Clustering analysis has been widely used in trust evaluation on various ...
research
05/11/2018

Convex Programming Based Spectral Clustering

Clustering is a fundamental task in data analysis, and spectral clusteri...
research
06/08/2015

A Topological Approach to Spectral Clustering

We propose a clustering algorithm which, for input, takes data assumed t...
research
10/01/2014

Riemannian Multi-Manifold Modeling

This paper advocates a novel framework for segmenting a dataset in a Rie...
research
10/21/2008

Foundations of a Multi-way Spectral Clustering Framework for Hybrid Linear Modeling

The problem of Hybrid Linear Modeling (HLM) is to model and segment data...
research
03/04/2014

The Hidden Convexity of Spectral Clustering

In recent years, spectral clustering has become a standard method for da...

Please sign up or login with your details

Forgot password? Click here to reset