ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS

Author:

KUMAR PANKAJ1,KUMAR PIYUSH2

Affiliation:

1. Department of Computer Science, Purdue University, W. Lafayette, IN 47907, USA

2. Department of Computer Science, Florida State Univerity, Tallahassee, FL, 32306-4530, USA

Abstract

We implement an algorithm for k-clustering for small k in fixed dimensions and report experimental results here. Although the theoretical bounds on the running time are hopeless for 1 + ∊ approximating k-clusters, we note that for dimensions 2 and 3, k-clustering is practical for small k (k ≤ 4) and simple enough shapes. For the purposes of this paper, k is a small fixed constant.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. OptICS-EV: A Data-Driven Model for Optimal Installation of Charging Stations for Electric Vehicles;Computational Science – ICCS 2023;2023

2. Improvements on approximation algorithms for clustering probabilistic data;Knowledge and Information Systems;2021-08-30

3. Approximation Algorithms for Probabilistic k-Center Clustering;2020 IEEE International Conference on Data Mining (ICDM);2020-11

4. Optimal Trajectory for Curvature-Constrained UAV Mobile Base Stations;IEEE Wireless Communications Letters;2020

5. Improvements on the k-center Problem for Uncertain Data;Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2018-05-27

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3