AbstractIt is shown that the complete linkage clustering of n points in Rd, where d⩾1 is a constant, can be computed in optimal O(nlogn) time and linear space, under the L1 and L∞-metrics. Furthermore, for every other fixed Lt-metric, it is shown that it can be approximated within an arbitrarily small constant factor in O(nlogn) time and linear space
Given a set of n points and their pairwise distances, the goal of clustering is to partition the po...
Given a set of n points and their pairwise distances, the goal of clustering is to partition the po...
In this thesis we show that, for several clustering problems, we can extract a small set of points, ...
AbstractIt is shown that the complete linkage clustering of n points in Rd, where d⩾1 is a constant,...
In this thesis we study efficient computational methods for geometrical problems of practical import...
The diameter k-clustering problem is the problem of partitioning a finite subset of R^d into k subse...
International audienceWe consider the widely-used average-linkage, single-linkage, and Ward's method...
AbstractIn this paper, we consider the problem of clustering a set of n finite point-sets in d-dimen...
In this paper we present an n O(k 1\Gamma1=d ) time algorithm for solving the k-center problem i...
Let $S$ be a set of $n$ points in $d$-space and let $1 \leq k \leq n$ be an integer. A unified appro...
We consider the problem of finding efficiently a high quality k-clustering of n points in a (possibl...
Clustering, a fundamental task in data science and machine learning, groups a set of objects in such...
The advanced maximum-linkage-algorithm (AMLA) is a derivative of the maximum-linkage-algorithm (MLA)...
In agglomerative hierarchical clustering, the traditional approaches of computing cluster distances ...
In agglomerative hierarchical clustering, the traditional approaches of computing cluster distances ...
Given a set of n points and their pairwise distances, the goal of clustering is to partition the po...
Given a set of n points and their pairwise distances, the goal of clustering is to partition the po...
In this thesis we show that, for several clustering problems, we can extract a small set of points, ...
AbstractIt is shown that the complete linkage clustering of n points in Rd, where d⩾1 is a constant,...
In this thesis we study efficient computational methods for geometrical problems of practical import...
The diameter k-clustering problem is the problem of partitioning a finite subset of R^d into k subse...
International audienceWe consider the widely-used average-linkage, single-linkage, and Ward's method...
AbstractIn this paper, we consider the problem of clustering a set of n finite point-sets in d-dimen...
In this paper we present an n O(k 1\Gamma1=d ) time algorithm for solving the k-center problem i...
Let $S$ be a set of $n$ points in $d$-space and let $1 \leq k \leq n$ be an integer. A unified appro...
We consider the problem of finding efficiently a high quality k-clustering of n points in a (possibl...
Clustering, a fundamental task in data science and machine learning, groups a set of objects in such...
The advanced maximum-linkage-algorithm (AMLA) is a derivative of the maximum-linkage-algorithm (MLA)...
In agglomerative hierarchical clustering, the traditional approaches of computing cluster distances ...
In agglomerative hierarchical clustering, the traditional approaches of computing cluster distances ...
Given a set of n points and their pairwise distances, the goal of clustering is to partition the po...
Given a set of n points and their pairwise distances, the goal of clustering is to partition the po...
In this thesis we show that, for several clustering problems, we can extract a small set of points, ...
DOI
Add to ORKG