2012
DOI: 10.48550/arxiv.1203.6402
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Scalable K-Means++

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(19 citation statements)
references
References 0 publications
0
19
0
Order By: Relevance
“…al. [12] is one of the most popular clustering techniques. This algorithm divides the network into k clusters, where each cluster is defined by a reference node (centroid).…”
Section: Literature Reviewmentioning
confidence: 99%
“…al. [12] is one of the most popular clustering techniques. This algorithm divides the network into k clusters, where each cluster is defined by a reference node (centroid).…”
Section: Literature Reviewmentioning
confidence: 99%
“…The Point-Net and ResNet-50 network weights are updated accordingly. After MoCo v2 training, k-means clustering [3] is performed on the trained 3072-d object segment features (with C clusters). Each object segment is assigned with the corresponding cluster index as its initial category label, y i ∈ {1, 2, ..., C}.…”
Section: Iterative Segment Labelingmentioning
confidence: 99%
“…Summary Figure 1 illustrates the iterative segment labeling process. First, we get the initial guess of the labels {y i } n i=1 via k-means clustering [3] based on features learned with self-supervised training. Then, the network training and segment labeling process are applied iteratively for several rounds.…”
Section: Segment Labeling Network Design and Trainingmentioning
confidence: 99%
See 2 more Smart Citations