paper-with-me

홈 › Papers

How to tell when a clustering is (approximately) correct using convex relaxations

2018-12-01 · NeurIPS 2018 12 · Marina Meila

We introduce the Sublevel Set (SS) method, a generic method to obtain sufficient guarantees of near-optimality and uniqueness (up to small perturbations) for a clustering. This method can be instantiated for a variety of clustering loss functions for which convex relaxations exist. Obtaining the guarantees in practice amounts to solving a convex optimization. We demonstrate the applicability of this method by obtaining distribution free guarantees for K-means clustering on realistic data sets.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Methods 이 논문이 사용한 방법론

k-Means Clustering k-Means Clustering is a clustering algorithm that divides a training set into $k$ different clusters of examples that are near each other. It works by initializing $k$…

Similar Papers 제목 키워드 기반

Weighted total variation based convex clustering

2018-08-28 · Guodong Xu, Yu Xia, Hui Ji

Data clustering is a fundamental problem with a wide range of applications. Standard methods, eg the $k$-means method, usually require solving a non-convex optimization problem. Recently, total variation based convex rel…

Clustering

Subspace Clustering by Block Diagonal Representation

2018-05-23 · Canyi Lu, Jiashi Feng, Zhouchen Lin, Tao Mei 외

This paper studies the subspace clustering problem. Given some data points approximately drawn from a union of subspaces, the goal is to group these data points into their underlying subspaces. Many subspace clustering m…

Clustering

Reliable Clustering of Bernoulli Mixture Models

2017-10-05 · Amir Najafi, Abolfazl Motahari, Hamid R. Rabiee

A Bernoulli Mixture Model (BMM) is a finite mixture of random binary vectors with independent dimensions. The problem of clustering BMM data arises in a variety of real-world applications, ranging from population genetic…

Clustering

Guarantees for Hierarchical Clustering by the Sublevel Set method

2020-06-18 · Marina Meila

Meila (2018) introduces an optimization based method called the Sublevel Set method, to guarantee that a clustering is nearly optimal and "approximately correct" without relying on any assumptions about the distribution …

Clustering

Distribution free optimality intervals for clustering

2021-07-30 · Marina Meilă, Hanyu Zhang

We address the problem of validating the ouput of clustering algorithms. Given data $\mathcal{D}$ and a partition $\mathcal{C}$ of these data into $K$ clusters, when can we say that the clusters obtained are correct or m…

Clustering