2022
DOI: 10.1016/j.ins.2022.07.166
|View full text |Cite
|
Sign up to set email alerts
|

r-Reference points based k-means algorithm

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

2022
2022
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 14 publications
0
2
0
1
Order By: Relevance
“…Next, the above steps are repeated until the objective function converges. The data are then finally clustered into K categories, and the objective function is shown in Equation (3) [34]:…”
Section: Subjective Evaluation Of Participantsmentioning
confidence: 99%
“…Next, the above steps are repeated until the objective function converges. The data are then finally clustered into K categories, and the objective function is shown in Equation (3) [34]:…”
Section: Subjective Evaluation Of Participantsmentioning
confidence: 99%
“…Kim & Kim, 2023). Algoritma K-means merupakan teknik pengelompokan sederhana dan efektif namun algoritma K-means memakan waktu (Wang et al, 2022). Sebagian besar data sering diurutkan ke kelompok yang sama antara dua iterasi berturut-turut, terutama pada tahap akhir dari fase iterasi dari algoritma K-means.…”
Section: Metode Penelitianunclassified
“…K-Means Clustering algorithm categorizes financial transaction data into three clusters based on the similarities, with randomly determined cluster centers representing low, medium, and high-value financial transaction. These divided data clusters are then recalculated using Benford Law equation [21], [22], as shown in Fig. 1.…”
Section: B K-means Clustering Algorithmmentioning
confidence: 99%