2018
DOI: 10.26438/ijcse/v6i6.299303
|View full text |Cite
|
Sign up to set email alerts
|

Enhancing test case reduction by k-means algorithm and elbow method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
2
0
1

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(3 citation statements)
references
References 0 publications
0
2
0
1
Order By: Relevance
“…The clustering of microbial communities was explored with the k -means algorithm which minimizes the error inside the groups and maximizes the distance between clusters. We considered the Euclidean distance metric in our analysis and then tried to use the elbow method to determine the optimum number of clusters [ 22 ]. In this method, the slow-down point denotes the optimum number of clusters.…”
Section: Methodsmentioning
confidence: 99%
“…The clustering of microbial communities was explored with the k -means algorithm which minimizes the error inside the groups and maximizes the distance between clusters. We considered the Euclidean distance metric in our analysis and then tried to use the elbow method to determine the optimum number of clusters [ 22 ]. In this method, the slow-down point denotes the optimum number of clusters.…”
Section: Methodsmentioning
confidence: 99%
“…Metode Elbow adalah metode penentuan jumlah cluster atau nilai K terbaik secara tepat sebagai persentase dari hasil komparasi antara jumlah cluster membentuk sudut pada suatu titik [11], [12]. Jika nilai cluster pertama dengan nilai cluster kedua untuk sudut dalam grafik, atau jika nilainya paling banyak berkurang, jumlah nilai cluster sudah benar.…”
Section: Metode Elbowunclassified
“…To understand the dyeing properties of the given dye combination on different fabric types, we performed clustering analysis to the points that locate in the 18-dimensional space. K-means algorithm was used for clustering [14], and a simple elbow plot (the number of clusters N vs. K-means score) was generated for better understanding the clustering performance (Figure 2) [15][16]. The K-means score is defined as the total Euclidean distance from individual points to the clustering centers, which are randomly initialized and updated following the standard K-means algorithm.…”
Section: Clustering Analysis For the Oloration Propertymentioning
confidence: 99%