OpenAlex
PricingAboutJobs
Log inGet started
Work

How fast is the k-means method?

HTML

Year: 2005
Type: conference-paper
Source: Symposium on Discrete Algorithms
DOI: 10.5555/1070432.1070555
Authors: Sariel Har-Peled, Bardia Sadri
Institution: University of Illinois Urbana-Champaign
Language: English

Topic: Advanced Clustering Algorithms Research
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Keywords: K-means clustering, Lloyd's algorithm, iteration complexity, polynomial upper bounds, lower bounds, worst-case analysis, two-center problem, clustering heuristics

Open Access status: closed
OpenAlex ID: W2033387072
FWCI: 1.751
Cites: 16
Cited by: 54
Related to: 9
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms