arXiv · 1206.0771
Topological graph clustering with thin position
Abstract
A clustering algorithm partitions a set of data points into smaller sets (clusters) such that each subset is more tightly packed than the whole. Many approaches to clustering translate the vector data into a graph with edges reflecting a distance or similarity metric on the points, then look for highly connected subgraphs. We introduce such an algorithm based on ideas borrowed from the topological notion of thin position for knots and 3-dimensional manifolds.
Explore related subjects
Keep this discovery
Jesse Johnson. 2012-06-04. Topological graph clustering with thin position. https://arxiv.org/abs/1206.0771
Cite the original work for its findings. Save a collection to share your selection of sources.