2019
DOI: 10.3233/ida-173795
|View full text |Cite
|
Sign up to set email alerts
|

Scalable k-means for large-scale clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…With or without use of supervised data labels, datadependent hashing methods can be separated into two groups: unsupervised [16]- [19] and supervised [20]- [24]. Compared with the latter, the unsupervised can work well in more broad cases by aid of some extra method, such as clustering [25], [26]. To name a few, spectral hashing [16], [27] seeks compact binary codes of data-points so that the Hamming distance between binary codes correlates with semantic similarity.…”
Section: Introductionmentioning
confidence: 99%
“…With or without use of supervised data labels, datadependent hashing methods can be separated into two groups: unsupervised [16]- [19] and supervised [20]- [24]. Compared with the latter, the unsupervised can work well in more broad cases by aid of some extra method, such as clustering [25], [26]. To name a few, spectral hashing [16], [27] seeks compact binary codes of data-points so that the Hamming distance between binary codes correlates with semantic similarity.…”
Section: Introductionmentioning
confidence: 99%