2019 International Conference on Advances in Computing and Communication Engineering (ICACCE) 2019
DOI: 10.1109/icacce46606.2019.9079998
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient K-Means Clustering Initialization Using Optimization Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 5 publications
0
2
0
Order By: Relevance
“…The feature analysis on each channel uses k-mean clustering, the data for each feature in the word sample is calculated for the cluster center [23], [28]. Identification determines whether a sample of words is identical or not by comparing the distance to the center of the cluster.…”
Section: K-mean Clusteringmentioning
confidence: 99%
See 1 more Smart Citation
“…The feature analysis on each channel uses k-mean clustering, the data for each feature in the word sample is calculated for the cluster center [23], [28]. Identification determines whether a sample of words is identical or not by comparing the distance to the center of the cluster.…”
Section: K-mean Clusteringmentioning
confidence: 99%
“…Minimum MSE means that the noise in the word sample is reduced [23]. The noise reduction is determined by the accuracy of the weight value on the adaptive linear combiner.…”
mentioning
confidence: 99%