A polynomial algorithm for balanced clustering via graph partitioning

Luis Evaristo Caraballo, José-Miguel Díaz-Báñez and Nadine Kroher

European Journal of Operational Research, 2021, vol. 289, issue 2, 456-469

Abstract: 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.

Keywords: Clustering; Dynamic programming; Graph partitioning (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221720306421
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:289:y:2021:i:2:p:456-469

DOI: 10.1016/j.ejor.2020.07.031

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().