Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Clustering to the Fewest Clusters Under Intra-Cluster Dissimilarity
  Constraints   This paper introduces the equiwide clustering problem, where valid partitions
must satisfy intra-cluster dissimilarity constraints. Unlike most existing
clustering algorithms, equiwide clustering relies neither on density nor on a
predefined number of expected classes, but on a dissimilarity threshold. Its
main goal is to ensure an upper bound on the error induced by ultimately
replacing any object with its cluster representative. Under this constraint, we
then primarily focus on minimizing the number of clusters, along with potential
sub-objectives. We argue that equiwide clustering is a sound clustering
problem, and discuss its relationship with other optimization problems,
existing and novel implementations as well as approximation strategies. We
review and evaluate suitable clustering algorithms to identify trade-offs
between the various practical solutions for this clustering problem.

32
The categories of this paper are: atom-ph
20
The categories of this paper are: acc-phys
26
The categories of this paper are: bayes-an
2
The categories of this paper are: math
14
The categories of this paper are: math-ph
4
The categories of this paper are: cond-mat
27
The categories of this paper are: comp-gas
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg
8
The categories of this paper are: hep-ex
29
The categories of this paper are: funct-an
18
The categories of this paper are: econ
24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
25
The categories of this paper are: patt-sol