Graph Approximation and Clustering on a Budget

06/10/2014
by   Ethan Fetaya, et al.
0

We consider the problem of learning from a similarity matrix (such as spectral clustering and lowd imensional embedding), when computing pairwise similarities are costly, and only a limited number of entries can be observed. We provide a theoretical analysis using standard notions of graph approximation, significantly generalizing previous results (which focused on spectral clustering with two clusters). We also propose a new algorithmic approach based on adaptive sampling, which experimentally matches or improves on previous methods, while being considerably more general and computationally cheaper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2012

Spectral Clustering: An empirical study of Approximation Algorithms and its Application to the Attrition Problem

Clustering is the problem of separating a set of objects into groups (ca...
research
05/25/2018

Scalable Spectral Clustering Using Random Binning Features

Spectral clustering is one of the most effective clustering approaches t...
research
08/01/2023

Explainable Graph Spectral Clustering of Text Documents

Spectral clustering methods are known for their ability to represent clu...
research
01/29/2019

Approximating Spectral Clustering via Sampling: a Review

Spectral clustering refers to a family of unsupervised learning algorith...
research
02/05/2016

Compressive Spectral Clustering

Spectral clustering has become a popular technique due to its high perfo...
research
03/31/2017

Novel Framework for Spectral Clustering using Topological Node Features(TNF)

Spectral clustering has gained importance in recent years due to its abi...
research
12/05/2013

Impact of regularization on Spectral Clustering

The performance of spectral clustering can be considerably improved via ...

Please sign up or login with your details

Forgot password? Click here to reset