A Fuzzy Clustering Algorithm for the Mode Seeking Framework
Thomas Bonis, Steve Oudot

TL;DR
This paper introduces a fuzzy clustering algorithm based on mode seeking that uses a random walk on a neighborhood graph, controlled by a temperature parameter, to identify high-density regions and assign memberships, demonstrating scalability to large datasets.
Contribution
The paper presents a novel fuzzy clustering method leveraging a mode-seeking framework with a probabilistic approach, improving local information encoding and scalability.
Findings
The algorithm's behavior varies with the temperature parameter, from hard mode-seeking to fuzzy spectral clustering.
It effectively encodes local density information through cluster cores, addressing issues of random walk properties.
Demonstrated scalability on a dataset with one million points in 30 dimensions.
Abstract
In this paper, we propose a new fuzzy clustering algorithm based on the mode-seeking framework. Given a dataset in , we define regions of high density that we call cluster cores. We then consider a random walk on a neighborhood graph built on top of our data points which is designed to be attracted by high density regions. The strength of this attraction is controlled by a temperature parameter . The membership of a point to a given cluster is then the probability for the random walk to hit the corresponding cluster core before any other. While many properties of random walks (such as hitting times, commute distances, etc\dots) have been shown to enventually encode purely local information when the number of data points grows, we show that the regularization introduced by the use of cluster cores solves this issue. Empirically, we show how the choice of …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
