.png){kind=icon}
.png){kind=icon}
Return
A polynomial algorithm for balanced clustering via graph partitioning
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2020.07.031.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 whose adjacency matrix contains all necessary information for the clustering process. Consequently, the clustering task can be formulated as a graph partitioning problem. In this context, we propose a new cluster quality measure which uses the ratio of intra- and inter-cluster variance and allows us to compute the optimal clustering under the min-max principle in polynomial time. Our algorithm can be applied to both partitional and hierarchical clustering. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Clustering
Dynamic programming
Graph partitioning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W