OpenAlex
PricingAboutJobs
Log inGet started
Work

Fast density clustering strategies based on the k-means algorithm

HTML

Year: 2017
Type: article
Source: Pattern Recognition
DOI: 10.1016/j.patcog.2017.06.023
Authors: Liang Bai, Xueqi Cheng, Jiye Liang, Huawei Shen, Yike Guo
Institutions: Shanxi University, Chinese Academy of Sciences, Institute of Computing Technology, Imperial College London
Language: English

Topic: Advanced Clustering Algorithms Research
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Keywords: density-based clustering, K-means clustering, scalability, computational complexity reduction, concept approximation, approximate clustering, arbitrary-shaped clusters

Open Access status: closed

Funder: National Natural Science Foundation of China
Awards: G3332554125, G4840050833, G5783169264, G6417428991, G661989536
OpenAlex ID: W2635535303
FWCI: 9.666
Cites: 56
Cited by: 193
Related to: 10
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