An improved K‐means algorithm for big data
Abstract An improved version of K‐means clustering algorithm that can be applied to big data through lower processing loads with acceptable precision rates is presented here. In this method, the distances from one point to its two nearest centroids were used along with their variations in the last t...
Saved in:
Main Authors: | Fatemeh Moodi, Hamid Saadatfar |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2022-02-01
|
Series: | IET Software |
Subjects: | |
Online Access: | https://doi.org/10.1049/sfw2.12032 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fast Single Pbase Algoritbm for Utility Mining in Big Data
by: Junqiang Liu, et al.
Published: (2015-04-01) -
Big Data Analytics: A Tutorial of Some Clustering Techniques
by: Said Baadel
Published: (2021-09-01) -
A Novel Clustering Technique for Efficient Clustering of Big Data in Hadoop Ecosystem
by: Sunil Kumar, et al.
Published: (2019-12-01) -
Super Partition: fast, flexible, and interpretable large-scale data reduction in R
by: Katelyn J. Queen, et al.
Published: (2025-01-01) -
Method of improving big data value density based on heterogeneous association
by: Shaomin WANG, et al.
Published: (2017-12-01)