paper-with-me

Papers

Multiclass Total Variation Clustering

2013-06-05 · NeurIPS 2013 12 · Xavier Bresson, Thomas Laurent, David Uminsky, James H. von Brecht

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.

📄 PDF Abstract BibTeX arXiv:1306.1185

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Similar Papers 제목 키워드 기반

Quantification of Credal Uncertainty: A Distance-Based Approach

2026-03-28 · Xabier Gonzalez-Garcia, Siu Lun Chau, Julian Rodemann, Michele Caprio 외 arxiv

Credal sets, i.e., closed convex sets of probability measures, provide a natural framework to represent aleatoric and epistemic uncertainty in machine learning. Yet how to quantify these two types of uncertainty for a gi…

Multiclass Semi-Supervised Learning on Graphs using Ginzburg-Landau Functional Minimization

2013-06-06 · Cristina Garcia-Cardona, Arjuna Flenner, Allon G. Percus

We present a graph-based variational algorithm for classification of high-dimensional data, generalizing the binary diffuse interface model to the case of multiple classes. Motivated by total variation techniques, the me…

ClassificationGeneral Classification

Multiclass Data Segmentation using Diffuse Interface Methods on Graphs

2013-02-15 · Cristina Garcia-Cardona, Ekaterina Merkurjev, Andrea L. Bertozzi, Arjuna Flenner 외

We present two graph-based algorithms for multiclass segmentation of high-dimensional data. The algorithms use a diffuse interface model based on the Ginzburg-Landau functional, related to total variation compressed sens…

compressed sensingSegmentation

Clustering in Partially Labeled Stochastic Block Models via Total Variation Minimization

2019-11-03 · Alexander Jung

A main task in data analysis is to organize data points into coherent groups or clusters. The stochastic block model is a probabilistic model for the cluster structure. This model prescribes different probabilities for t…

ClusteringStochastic Block Model

Image segmentation based on the hybrid total variation model and the K-means clustering strategy

2016-05-30 · Baoli Shi, Zhi-Feng Pang, Jing Xu

The performance of image segmentation highly relies on the original inputting image. When the image is contaminated by some noises or blurs, we can not obtain the efficient segmentation result by using direct segmentatio…

ClusteringImage SegmentationSegmentationSemantic Segmentation