Loading...

K-Median Clustering for Imprecise Points

Farahzad, Sina | 2021

200 Viewed
  1. Type of Document: M.Sc. Thesis
  2. Language: Farsi
  3. Document No: 54249 (19)
  4. University: Sharif University of Technology
  5. Department: Computer Engineering
  6. Advisor(s): Abam, Mohammad Ali
  7. Abstract:
  8. We study the problem of preclustering a set B of imprecise points in Rd. we wish to cluster the regions specifying the potential locations of the points such that, no matter where the points are located within their regions, the resulting clustering approximates the optimal clustering for those locations. We consider k-median clustering, and obtain the following results.First we present a (6k, 2)-preclustering in R2. Then we present a preclusterings for balls in Rd, including a (3k, α)-preclustering with α = 13.9 for the k-median problem. At last we show that we need at least 3k − 3 preclusters to obtain a bounded approximation ratio for this problem
  9. Keywords:
  10. Clustering ; Approximate Algorithm ; Imprecise Points Clustering ; K-Median Clustering

 Digital Object List

 Bookmark