AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Unsupervised Order Learning

Seon-Ho Lee, Nyeong-Ho Shin, Chang-Su Kim

ICLR 2024 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms

Read the paperCheck your idea against 137,217 papers

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

Proposes unsupervised order learning (UOL), a clustering method for orderable data that combines ordered k-means with a network embedding that sorts objects along a chain of line segments defined by cluster centers.

Problem

Clustering of orderable data (objects with a natural ordering) where standard clustering ignores the order between clusters.

Approach

Groups objects into ordered clusters by penalizing deviation from consecutive clusters (ordered k-means), then trains a network to embed objects compactly along a chain of line segments determined by the cluster centers, so that the embedding respects the learned order.

Experimental setup

Builds on: k-means

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