2018
DOI: 10.1007/s10586-018-2262-4
|View full text |Cite
|
Sign up to set email alerts
|

Cuckoo, Bat and Krill Herd based k-means++ clustering algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 26 publications
(7 citation statements)
references
References 30 publications
0
7
0
Order By: Relevance
“…The K -means++ algorithm is based on the traditional K -means algorithm, which makes improvements to the initial clustering center selection; assuming that n manufacturing cell centers have been selected (0 < n < K ), then when selecting the first n + 1 manufacturing cell centers, the more distant points from the current n manufacturing cell center have a higher probability to be selected as the first n + 1 manufacturing cell centers. Additionally, it overcomes the effect of random selection of the initial clustering centers of the traditional K -means algorithm and effectively improves the clarity and efficiency of manufacturing cell classification [ 27 ]. The specific processes of the K -means++ algorithm for classifying the manufacturing cells of complex aerospace components are summarized as follows: Input: product-equipment matrix X = { x 1 , x 2 , ⋯, x n } and number of manufacturing cells K Output: K manufacturing cells both product processing families C j and j = 1,2, ⋯, n Step 1: we randomly select a sample of points from the product-equipment matrix as the cluster center of the current manufacturing cell m r .…”
Section: Layout Planning Methodsmentioning
confidence: 99%
“…The K -means++ algorithm is based on the traditional K -means algorithm, which makes improvements to the initial clustering center selection; assuming that n manufacturing cell centers have been selected (0 < n < K ), then when selecting the first n + 1 manufacturing cell centers, the more distant points from the current n manufacturing cell center have a higher probability to be selected as the first n + 1 manufacturing cell centers. Additionally, it overcomes the effect of random selection of the initial clustering centers of the traditional K -means algorithm and effectively improves the clarity and efficiency of manufacturing cell classification [ 27 ]. The specific processes of the K -means++ algorithm for classifying the manufacturing cells of complex aerospace components are summarized as follows: Input: product-equipment matrix X = { x 1 , x 2 , ⋯, x n } and number of manufacturing cells K Output: K manufacturing cells both product processing families C j and j = 1,2, ⋯, n Step 1: we randomly select a sample of points from the product-equipment matrix as the cluster center of the current manufacturing cell m r .…”
Section: Layout Planning Methodsmentioning
confidence: 99%
“…The K-Means++ approach ensures that centroids are initialized at distant places, reducing the chance of empty clusters or numerous clusters linked to a single centroid. Because of this initialization stage, the centroids are equally distributed over the data space, reducing the possibility that the algorithm may become caught in a specific minimum [77]. K-Means++ and the regular K-Means method are essentially identical, with the exception of the initial step.…”
Section: K-means++mentioning
confidence: 99%
“…Each cluster has a center, called the center of mass, and the k-value needs to be given. The k-means clustering algorithm proceeds as follows [51]:…”
Section: Scenario Analysis Of Electric Heatingmentioning
confidence: 99%