Add to ORKGLet $S$ be a set of $n$ points in $d$-space and let $1 \leq k \leq n$ be an integer. A unified approach is given for solving the problem of finding a subset of $S$ of size $k$ that minimizes some closeness measure, such as the diameter, perimeter or the circumradius. Moreover, data structures are given that maintain such a subset under insertions and deletions of points
Given a set S of n points in k-dimensional space, and an Lt metric, the dynamic closest-pair problem...
AbstractIn k-means clustering we are given a set of n data points in d-dimensional space Rd and an i...
Clustering problems often arise in fields like data mining and machine learning. Clustering usually ...
Let $S$ be a set of $n$ points in $d$-space and let $1 \leq k \leq n$ be an integer. A unified appro...
AbstractIn this paper, we consider the problem of clustering a set of n finite point-sets in d-dimen...
We study the min-size $k$-clustering problem, a geometric clustering problem which generalizes clust...
Introduction Clustering is an important problem, with applications in areas such as data mining and...
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 (&...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ("c...
Given a set S of n points in k-dimensional space, and an L t metric, the dynamic closest pair proble...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ("c...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ( c...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ("c...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ("c...
Given a set S of n points in k-dimensional space, and an Lt metric, the dynamic closest-pair problem...
AbstractIn k-means clustering we are given a set of n data points in d-dimensional space Rd and an i...
Clustering problems often arise in fields like data mining and machine learning. Clustering usually ...
Let $S$ be a set of $n$ points in $d$-space and let $1 \leq k \leq n$ be an integer. A unified appro...
AbstractIn this paper, we consider the problem of clustering a set of n finite point-sets in d-dimen...
We study the min-size $k$-clustering problem, a geometric clustering problem which generalizes clust...
Introduction Clustering is an important problem, with applications in areas such as data mining and...
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 (&...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ("c...
Given a set S of n points in k-dimensional space, and an L t metric, the dynamic closest pair proble...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ("c...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ( c...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ("c...
A k-clustering of a given set of points in the plane is a partition of the points into k subsets ("c...
Given a set S of n points in k-dimensional space, and an Lt metric, the dynamic closest-pair problem...
AbstractIn k-means clustering we are given a set of n data points in d-dimensional space Rd and an i...
Clustering problems often arise in fields like data mining and machine learning. Clustering usually ...