2017
DOI: 10.1007/978-981-10-3920-1_7
|View full text |Cite
|
Sign up to set email alerts
|

K-Mean Clustering Algorithm Approach for Data Mining of Heterogeneous Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0
3

Year Published

2020
2020
2022
2022

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(11 citation statements)
references
References 3 publications
0
8
0
3
Order By: Relevance
“…The k-means algorithm is commonly used in the partition of N-dimensional population into k series based on a sample [52,53]. Where k-series corresponds to the number of clusters to be calculated, arbitrarily specified by the researcher.…”
Section: Groupings By K-means Partitionmentioning
confidence: 99%
See 1 more Smart Citation
“…The k-means algorithm is commonly used in the partition of N-dimensional population into k series based on a sample [52,53]. Where k-series corresponds to the number of clusters to be calculated, arbitrarily specified by the researcher.…”
Section: Groupings By K-means Partitionmentioning
confidence: 99%
“…Alternatively, centroids can also be specified; 2) if the centroids are not specified, they are obtained randomly for each group; 3) by calculating the Euclidean distance, each object is assigned to its closest centroid; 4) the centroids are updated considering the recently incorporated objects; 5) each observation is reviewed with respect to the other clusters to confirm their membership to the respective group. The assignment and update steps are repeated until convergence or the total number of iterations are reached [53]. This method implies advantages when the author has prior knowledge of the analyzed data.…”
Section: Groupings By K-means Partitionmentioning
confidence: 99%
“…K-Means clustering is a type of unsupervised learning that divides unlabeled data into non-overlapping groups [20]. The algorithm performs the iterative assignment of each data point to one of the K groups based on the least distance of centroids to their feature space.…”
Section: K-means Clusteringmentioning
confidence: 99%
“…Varied approaches are available in data science to group the data and build based on closeness among the information, density in the dataset, or new neural network presentation. Any of them are K-Means forms of clustering, intensity clustering and self-organization maps [15].…”
Section: Data Setmentioning
confidence: 99%