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
We study the problem of finding an optimum clustering, a problem known to be NP-hard. Existing liter...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets (&q...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets (&...
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...
In this paper we present an n O(k 1\Gamma1=d ) time algorithm for solving the k-center problem i...
<p>Complete linkage clustering based on Nei’s distance (cophenetic correlation = 0.92).</p
Let $S$ be a set of $n$ points in $d$-space and let $1 \leq k \leq n$ be an integer. A unified appro...
In this paper, we present a linear-time approximation scheme for k-means clustering of incomplete da...
We present a general approach for designing approximation algorithms for a fundamental class of geom...
AbstractGreedily seriating objects one by one is implicitly employed in many heuristic clustering pr...
We define a general variant of the graph clustering problem where the criterion of density for the c...
1643861PDFTech ReportD-STOP/2016/111Technical Report 111DTRT13-G-UTC58Computer visionHighway operati...
In this thesis we show that, for several clustering problems, we can extract a small set of points, ...
We study the problem of finding an optimum clustering, a problem known to be NP-hard. Existing liter...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets (&q...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets (&...
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...
In this paper we present an n O(k 1\Gamma1=d ) time algorithm for solving the k-center problem i...
<p>Complete linkage clustering based on Nei’s distance (cophenetic correlation = 0.92).</p
Let $S$ be a set of $n$ points in $d$-space and let $1 \leq k \leq n$ be an integer. A unified appro...
In this paper, we present a linear-time approximation scheme for k-means clustering of incomplete da...
We present a general approach for designing approximation algorithms for a fundamental class of geom...
AbstractGreedily seriating objects one by one is implicitly employed in many heuristic clustering pr...
We define a general variant of the graph clustering problem where the criterion of density for the c...
1643861PDFTech ReportD-STOP/2016/111Technical Report 111DTRT13-G-UTC58Computer visionHighway operati...
In this thesis we show that, for several clustering problems, we can extract a small set of points, ...
We study the problem of finding an optimum clustering, a problem known to be NP-hard. Existing liter...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets (&q...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets (&...
DOI
Add to ORKG