Personne

Xavier Bresson

Cette personne n’est plus à l’EPFL

Publications associées (47)

Structured Sequence Modeling with Graph Convolutional Recurrent Networks

Pierre Vandergheynst, Xavier Bresson, Michaël Defferrard, Youngjoo Seo

This paper introduces Graph Convolutional Recurrent Network (GCRN), a deep learning model able to predict structured sequences of data. Precisely, GCRN is a generalization of classical recurrent neural networks (RNN) to data structured by an arbitrary grap ...
2017

FMA: A Dataset For Music Analysis

Pierre Vandergheynst, Kirell Maël Benzi, Xavier Bresson, Michaël Defferrard

We introduce the Free Music Archive (FMA), an open and easily accessible dataset which can be used to evaluate several tasks in music information retrieval (MIR), a field concerned with browsing, searching, and organizing large music collections. The commu ...
2017

Transient networks of spatio-temporal connectivity map communication pathways in brain functional systems

Jean-Philippe Thiran, Pierre Vandergheynst, Alessandra Griffa, Kirell Maël Benzi, Patric Hagmann, Alessandro Daducci, Xavier Bresson, Benjamin Ricaud

The study of brain dynamics enables us to characterize the time-varying functional connectivity among distinct neural groups. However, current methods suffer from the absence of structural connectivity information. We propose to integrate infra-slow neural ...
Elsevier2017

Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering

Pierre Vandergheynst, Xavier Bresson, Michaël Defferrard

In this work, we are interested in generalizing convolutional neural networks (CNNs) from low-dimensional regular grids, where image, video and speech are represented, to high-dimensional irregular domains, such as social networks, brain connectomes or wor ...
2016

Song Recommendation with Non-Negative Matrix Factorization and Graph Total Variation

Pierre Vandergheynst, Kirell Maël Benzi, Xavier Bresson, Vasilis Kalofolias

This work formulates a novel song recommender system as a matrix completion problem that benefits from collaborative filtering through Non-negative Matrix Factorization (NMF) and content-based filtering via total variation (TV) on graphs. The graphs encode ...
Ieee2016

Source Localization on Graphs via l1 Recovery and Spectral Graph Theory

Pierre Vandergheynst, Xavier Bresson, Rodrigo Cerqueira Gonzalez Pena

We cast the problem of source localization on graphs as the simultaneous problem of sparse recovery and diffusion ker- nel learning. An l1 regularization term enforces the sparsity constraint while we recover the sources of diffusion from a single snapshot ...
Ieee2016

Consistency of Cheeger and Ratio Graph Cuts

Xavier Bresson

This paper establishes the consistency of a family of graph-cut-based algorithms for clustering of data clouds. We consider point clouds obtained as samples of a ground-truth measure. We investigate approaches to clustering based on minimizing objective fu ...
Microtome Publ2016

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

Enhanced Matrix Completion with Manifold Learning

Pierre Vandergheynst, Michael Bronstein, Xavier Bresson, Vasilis Kalofolias

We study the problem of matrix completion when infor- mation about row or column proximities is available, in the form of weighted graphs. The problem can be formulated as the optimization of a convex function that can be solved efficiently using the alter ...
2015

Harmonic Active Contours

Jean-Philippe Thiran, Xavier Bresson, Dominique Zosso, Virginia Estellers Casas

We propose a segmentation method based on the geometric representation of images as two-dimensional manifolds embedded in a higher dimensional space. The segmentation is formulated as a minimization problem, where the contours are described by a level set ...
Institute of Electrical and Electronics Engineers2014

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.