2019
DOI: 10.1007/s00521-019-04673-0
|View full text |Cite
|
Sign up to set email alerts
|

Rethinking k-means clustering in the age of massive datasets: a constant-time approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(12 citation statements)
references
References 48 publications
0
12
0
Order By: Relevance
“…Hence, k-means clustering is employed to test the proposed method in this paper. Recently, several techniques have been proposed to improve the standard k-means algorithm for high dimensional datasets, such as the Entropy Regularized Power k-Means [4], sparse k-means [41] and others [24]. The proposed k-Fold CV for unsupervised learning can also be applied to these modified versions of the k-means algorithm.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…Hence, k-means clustering is employed to test the proposed method in this paper. Recently, several techniques have been proposed to improve the standard k-means algorithm for high dimensional datasets, such as the Entropy Regularized Power k-Means [4], sparse k-means [41] and others [24]. The proposed k-Fold CV for unsupervised learning can also be applied to these modified versions of the k-means algorithm.…”
Section: Proposed Methodsmentioning
confidence: 99%
“…In the evaluations, we select 30 testing scenarios uniformly at random for each of the three SPLs so that we can use parametric statistical hypothesis tests to determine whether or not there is a significant difference between inc and sm approaches [27], [28]. Each testing scenario has an EP and a PUC; PUCs are used to collect data on the approaches.…”
Section: Spls Under Consideration and Testing Scenariosmentioning
confidence: 99%
“…The output of segmentation is a set of k non-overlapping segments {S 1 , S 2 , … , S k } that comprises the whole segmented representation of a dataset X in the form of [15]:…”
Section: The Color Image Segmentation Algorithmmentioning
confidence: 99%