Algorithms and Complexity of Range Clustering

05/14/2018
by   Dorit S. Hochbaum, et al.
0

We introduce a novel criterion in clustering that seeks clusters with limited range of values associated with each cluster's elements. In clustering or classification the objective is to partition a set of objects into subsets, called clusters or classes, consisting of similar objects so that different clusters are as dissimilar as possible. We propose a number of objective functions that employ the range of the clusters as part of the objective function. Several of the proposed objectives mimic objectives based on sums of similarities. These objective functions are motivated by image segmentation problems, where the diameter, or range of values associated with objects in each cluster, should be small. It is demonstrated that range-based problems are in general easier, in terms of their complexity, than the analogous similarity-sum problems. Several of the problems we present could therefore be viable alternatives to existing clustering problems which are NP-hard, offering the advantage of efficient algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/14/2023

Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations

Finding (bi-)clusters in bipartite graphs is a popular data analysis app...
research
07/28/2022

Expanding the class of global objective functions for dissimilarity-based hierarchical clustering

Recent work on dissimilarity-based hierarchical clustering has led to th...
research
04/24/2020

Non-Exhaustive, Overlapping Co-Clustering: An Extended Analysis

The goal of co-clustering is to simultaneously identify a clustering of ...
research
01/20/2020

Deep Image Clustering with Tensor Kernels and Unsupervised Companion Objectives

In this paper we develop a new model for deep image clustering, using co...
research
09/09/2021

An objective function for order preserving hierarchical clustering

We present an objective function for similarity based hierarchical clust...
research
02/06/2020

Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability

Improving the explainability of the results from machine learning method...
research
02/09/2020

Bi-objective Optimization of Biclustering with Binary Data

Clustering consists of partitioning data objects into subsets called clu...

Please sign up or login with your details

Forgot password? Click here to reset