A Polynomial Algorithm for Balanced Clustering via Graph Partitioning

01/10/2018
by   Luis-Evaristo Caraballo, et al.
0

The objective of clustering is to discover natural groups in datasets and to identify geometrical structures which might reside there, without assuming any prior knowledge on the characteristics of the data. The problem can be seen as detecting the inherent separations between groups of a given point set in a metric space governed by a similarity function. The pairwise similarities between all data objects form a weighted graph adjacency matrix which contains all necessary information for the clustering process, which can consequently be formulated as a graph partitioning problem. In this context, we propose a new cluster quality measure which uses the maximum spanning tree and allows us to compute the optimal clustering under the min-max principle in polynomial time. Our algorithm can be applied when a load-balanced clustering is required.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/27/2020

Load-Balanced Bottleneck Objectives in Process Mapping

We propose a new problem formulation for graph partitioning that is tail...
research
06/28/2019

Min-Max Correlation Clustering via MultiCut

Correlation clustering is a fundamental combinatorial optimization probl...
research
05/09/2015

Relations Between Adjacency and Modularity Graph Partitioning

In this paper the exact linear relation between the leading eigenvector ...
research
08/19/2020

Balanced Order Batching with Task-Oriented Graph Clustering

Balanced order batching problem (BOBP) arises from the process of wareho...
research
02/05/2019

Adjacency-constrained hierarchical clustering of a band similarity matrix with application to Genomics

Motivation: Genomic data analyses such as Genome-Wide Association Studie...
research
10/25/2021

Shift of Pairwise Similarities for Data Clustering

Several clustering methods (e.g., Normalized Cut and Ratio Cut) divide t...
research
03/03/2023

Generalizing Lloyd's algorithm for graph clustering

Clustering is a commonplace problem in many areas of data science, with ...

Please sign up or login with your details

Forgot password? Click here to reset