2017
DOI: 10.4316/aece.2017.04001
|View full text |Cite
|
Sign up to set email alerts
|

Centroid Update Approach to K-Means Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(6 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…e objective function is required to be consistent with the error sum of the square sum of the search direction during the search operation. K-means clustering algorithm is a new scientific and effective bank loan risk management analysis algorithm, which mainly performs quantitative analysis [20]. When dealing with cubes, the size reduction technology can be used as the dimension of the two-dimensional transformation, and the dimensionality reduction actually uses some means to process the higher-dimensional data into the lower-dimensional data, and at the same time, the similarity between the data and the data before processing is consistent with the most basic data.…”
Section: Similarity Measurementioning
confidence: 99%
“…e objective function is required to be consistent with the error sum of the square sum of the search direction during the search operation. K-means clustering algorithm is a new scientific and effective bank loan risk management analysis algorithm, which mainly performs quantitative analysis [20]. When dealing with cubes, the size reduction technology can be used as the dimension of the two-dimensional transformation, and the dimensionality reduction actually uses some means to process the higher-dimensional data into the lower-dimensional data, and at the same time, the similarity between the data and the data before processing is consistent with the most basic data.…”
Section: Similarity Measurementioning
confidence: 99%
“…There are also studies that present algorithm developments for two stages [6], such as the study that presented various methods for improving the initialisation and classification stages through cluster information and their DPs in the previous iteration [25]. The article reviewed by [26] proposed a heuristic algorithm which accelerates convergence by predicting the centroid locations according to statistical information from previous iterations. The other recent approaches for improving the K‐means algorithm use different distance measurements than the Euclidean measurement [27–29].…”
Section: Related Workmentioning
confidence: 99%
“…Applied the k-means cluster analysis with the application of data mining techniques. K-means cluster is described, among others, in the books: L. Kaufman, P. Rousseeuw [145], and A. Kassambara [146], and in papers [147][148][149]. Clustering is a process of partitioning a set of data objects from one set into multiple classes.…”
Section: Data Sources and Study Designmentioning
confidence: 99%