Self-Adaptive K-Means Based on a Covering Algorithm
The K-means algorithm is one of the ten classic algorithms in the area of data mining and has been studied by researchers in numerous fields for a long time. However, the value of the clustering number k in the K-means algorithm is not always easy to be determined, and the selection of the initial c...
Saved in:
Main Authors: | Yiwen Zhang, Yuanyuan Zhou, Xing Guo, Jintao Wu, Qiang He, Xiao Liu, Yun Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2018-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2018/7698274 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
An improved K‐means algorithm for big data
by: Fatemeh Moodi, et al.
Published: (2022-02-01) -
Improved K-Means Algorithm for Nearby Target Localization
by: Zongwen Yuan, et al.
Published: (2025-01-01) -
Climate Regionalization of Asphalt Pavement Based on the K-Means Clustering Algorithm
by: Yanhai Yang, et al.
Published: (2020-01-01) -
Self-Adaptive Step Firefly Algorithm
by: Shuhao Yu, et al.
Published: (2013-01-01) -
Retracted: K-Means Algorithm to Identify the Elderly Psychological Stress Analysis Algorithm
by: Advances in Multimedia
Published: (2023-01-01)