HyperAIHyperAI

Command Palette

Search for a command to run...

3 months ago

Deep Repulsive Clustering of Ordered Data Based on Order-Identity Decomposition

{Chang-Su Kim Seon-Ho Lee}

Deep Repulsive Clustering of Ordered Data Based on Order-Identity Decomposition

Abstract

We propose the deep repulsive clustering (DRC) algorithm of ordered data for effective order learning. First, we develop the order-identity decomposition (ORID) network to divide the information of an object instance into an order-related feature and an identity feature. Then, we group object instances into clusters according to their identity features using a repulsive term. Moreover, we estimate the rank of a test instance, by comparing it with references within the same cluster. Experimental results on facial age estimation, aesthetic score regression, and historical color image classification show that the proposed algorithm can cluster ordered data effectively and also yield excellent rank estimation performance.

Benchmarks

BenchmarkMethodologyMetrics
age-estimation-on-morph-album2-caucasianDRC-ORID
MAE: 2.26

Build AI with AI

From idea to launch — accelerate your AI development with free AI co-coding, out-of-the-box environment and best price of GPUs.

AI Co-coding
Ready-to-use GPUs
Best Pricing
Get Started

Hyper Newsletters

Subscribe to our latest updates
We will deliver the latest updates of the week to your inbox at nine o'clock every Monday morning
Powered by MailChimp
Deep Repulsive Clustering of Ordered Data Based on Order-Identity Decomposition | Papers | HyperAI