LSD-C: linearly separable deep clusters
We present LSD-C, a novel method to identify clusters in an unlabeled dataset. Our algorithm first establishes pairwise connections in the feature space between the samples of the minibatch based on a similarity metric. Then it regroups in clusters the connected samples and enforces a linear separat...
Huvudupphovsmän: | Rebuffi, SA, Ehrhardt, S, Han, K, Vedaldi, A, Zisserman, A |
---|---|
Materialtyp: | Conference item |
Språk: | English |
Publicerad: |
IEEE
2021
|
Liknande verk
Liknande verk
-
Automatically discovering and learning new visual categories with ranking statistics
av: Han, K, et al.
Publicerad: (2020) -
Semi-supervised learning with scarce annotations
av: Rebuffi, SA, et al.
Publicerad: (2020) -
AutoNovel: automatically discovering and learning novel visual categories
av: Han, K, et al.
Publicerad: (2021) -
Learning to discover novel visual categories via deep transfer clustering
av: Han, K, et al.
Publicerad: (2020) -
Efficient parametrization of multi-domain deep neural networks
av: Rebuffi, S, et al.
Publicerad: (2018)