atlas

Research map / Learning theory and algorithms / Clustering

Deep Embedded Non-Redundant Clustering

AAAI 2020 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 18 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
jointly train non-linear autoencoder embedding with non-redundant clustering (ENRC) vs linear subspace baseline Nr-Kmeans on fixed autoencoder embeddingNr-Kmeans · NR-Objects colorNMI: 0.92 -> 1.00Helped
joint transformation (ENRC) vs Nr-KmeansNr-Kmeans · C-MNIST leftNMI: 0.69 -> 0.83Helped
joint transformation (ENRC) vs Nr-KmeansNr-Kmeans · GTSRB typeNMI: 0.72 -> 0.74Helped
joint transformation (ENRC) vs Nr-KmeansNr-Kmeans · StickfiguresNMI: 1.00 -> 1.00No clear effect
ENRC vs Nr-Kmeans on redundancy between found clusteringsNr-Kmeans · NR-Objects, GTSRB, Stickfigures, C-MNISTVI: 2.39 vs 2.35 (NR-Objects)No clear effect
sequential Orth1 vs parallel joint extraction (ENRC)Orth1 · NR-Objects shapeNMI: 0.39 -> 1.00Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy