Research map / Learning theory and algorithms / Clustering
Unsupervised Order Learning
Seon-Ho Lee, Nyeong-Ho Shin, Chang-Su Kim
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
- The Catalog Problem: Clustering and Ordering Variable-Sized Sets (ICML 2023 · similarity 0.85)
- Order Learning Using Partially Ordered Data via Chainization (ECCV 2022 · similarity 0.85)
- Deep Repulsive Clustering of Ordered Data Based on Order-Identity Decomposition (ICLR 2021 · similarity 0.84)
- Stochastic Order Learning: An Approach to Rank Estimation Using Noisy Data (ICML 2026 · similarity 0.84)
- Relative Order Analysis and Optimization for Unsupervised Deep Metric Learning (CVPR 2021 · similarity 0.83)
- Ultrametric Cluster Hierarchies: I Want ‘em All! (NeurIPS 2025 · similarity 0.82)
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.
