Publications related to Testing Graph Clusterability: Algorithms and Lower Bounds

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Low-Rank Matrices on Graphs: Generalized Recovery & Applications

Pierre Vandergheynst, Nathanaël Perraudin, Nauman Shahid

Many real world datasets subsume a linear or non-linear low-rank structure in a very low-dimensional space. Unfortunately, one often has very little or no information about the geometry of the space, resulting in a highly under-determined recovery problem. ...

2016

On the Zarankiewicz problem for intersection hypergraphs

János Pach

Let d and t be fixed positive integers, and let denote the complete d-partite hypergraph with t vertices in each of its parts, whose hyperedges are the d-tuples of the vertex set with precisely one element from each part. According to a fundamental theorem ...

Academic Press Inc Elsevier Science2016

Random sampling of bandlimited signals on graphs

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy, Nicolas Tremblay

We study the problem of sampling

k

-bandlimited signals on graphs. We propose two sampling strategies that consist in selecting a small subset of nodes at random. The first strategy is non-adaptive, \ie, independent of the graph structure, and its perform ...

2015

Robust Principal Component Analysis on Graphs

Pierre Vandergheynst, Michael Bronstein, Xavier Bresson, Nauman Shahid, Vasilis Kalofolias

Principal Component Analysis (PCA) is the most widely used tool for linear dimensionality reduction and clustering. Still it is highly sensitive to outliers and does not scale well with respect to the number of data samples. Robust PCA solves the first iss ...

2015

What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid

Volkan Cevher, Yen-Huan Li

We design a sublinear Fourier sampling algorithm for a case of sparse off-grid frequency recovery. These are signals with the form ; i.e., exponential polynomials with a noise term. The frequencies satisfy and for some . We design a sublinear time randomiz ...

Springer Verlag2015

Right-Protected Data Publishing with Provable Distance-Based Mining

Michail Vlachos, Nikolaos Freris

Protection of one's intellectual property is a topic with important technological and legal facets. We provide mechanisms for establishing the ownership of a dataset consisting of multiple objects. The algorithms also preserve important properties of the d ...

Ieee Computer Soc2014

Hexagonal Class Representation for Fingerprinting and Facile Comparison of Petroleomic Samples

Yury Tsybin, Anton Kozhinov, Konstantin Zhurov

Because of the high complexity of petroleomic-type samples, there is a need for efficient ways of visualizing and interpreting the resulting data in mass spectrometry-based petroleomics. Over the years, several graphing approaches have become widespread, y ...

Amer Chemical Soc2013

treeKL: A distance between high dimension empirical distributions

François Fleuret

This paper offers a methodological contribution for computing the distance between two empirical distributions in an Euclidean space of very large dimension. We propose to use decision trees instead of relying on standard quantification of the feature spac ...

Elsevier Science Bv2013

Random sampling of bandlimited signals on graphs

Pierre Vandergheynst, Rémi Gribonval, Gilles Puy, Nicolas Tremblay

We study the problem of sampling

k

2015

Testing Graph Clusterability: Algorithms and Lower Bounds

Graph Chatbot

Chat with Graph Search

Low-Rank Matrices on Graphs: Generalized Recovery & Applications

On the Zarankiewicz problem for intersection hypergraphs

Random sampling of bandlimited signals on graphs

Robust Principal Component Analysis on Graphs

What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid

Right-Protected Data Publishing with Provable Distance-Based Mining

Hexagonal Class Representation for Fingerprinting and Facile Comparison of Petroleomic Samples

treeKL: A distance between high dimension empirical distributions

Graph-Based Information Processing

Remote sensing image segmentation by active queries

Random sampling of bandlimited signals on graphs

On the Zarankiewicz problem for intersection hypergraphs

What's the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid

Robust Principal Component Analysis on Graphs

Hexagonal Class Representation for Fingerprinting and Facile Comparison of Petroleomic Samples

Graph-Based Information Processing

Remote sensing image segmentation by active queries

Low-Rank Matrices on Graphs: Generalized Recovery & Applications

Right-Protected Data Publishing with Provable Distance-Based Mining

treeKL: A distance between high dimension empirical distributions