Multiclass Total Variation Clustering

06/05/2013
by   Xavier Bresson, et al.
0

Ideas from the image processing literature have recently motivated a new set of clustering algorithms that rely on the concept of total variation. While these algorithms perform well for bi-partitioning tasks, their recursive extensions yield unimpressive results for multiclass clustering tasks. This paper presents a general framework for multiclass total variation clustering that does not rely on recursion. The results greatly outperform previous total variation algorithms and compare well with state-of-the-art NMF approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2018

Weighted Nonlocal Total Variation in Image Processing

In this paper, a novel weighted nonlocal total variation (WNTV) method i...
research
09/07/2023

Total Variation Floodgate for Variable Importance Inference in Classification

Inferring variable importance is the key problem of many scientific stud...
research
02/26/2015

Total variation on a tree

We consider the problem of minimizing the continuous valued total variat...
research
05/27/2019

Fast Decomposable Submodular Function Minimization using Constrained Total Variation

We consider the problem of minimizing the sum of submodular set function...
research
01/25/2017

Photographic dataset: playing cards

This is a photographic dataset collected for testing image processing al...
research
08/28/2018

Weighted total variation based convex clustering

Data clustering is a fundamental problem with a wide range of applicatio...
research
01/18/2021

Optimal Pre-Processing to Achieve Fairness and Its Relationship with Total Variation Barycenter

We use disparate impact, i.e., the extent that the probability of observ...

Please sign up or login with your details

Forgot password? Click here to reset