SPTM-L1.1
A WASSERSTEIN GRAPH DISTANCE BASED ON DISTRIBUTIONS OF PROBABILISTIC NODE EMBEDDINGS
Michael Scholkemper, Damin Kühn, Gerion Nabbefeld, Simon Musall, Björn Kampa, Michael Schaub, RWTH Aachen, Germany
Session:
SPTM-L1: Signal and Information Processing over Graphs Lecture
Track:
Signal Processing Theory and Methods
Location:
Room 205B
Presentation Time:
Tue, 16 Apr, 13:10 - 13:30 (UTC +9)
Session Co-Chairs:
Anna Scaglione, Cornell University and Roula Nassif, Université Côte d’Azur
Session SPTM-L1
SPTM-L1.1: A WASSERSTEIN GRAPH DISTANCE BASED ON DISTRIBUTIONS OF PROBABILISTIC NODE EMBEDDINGS
Michael Scholkemper, Damin Kühn, Gerion Nabbefeld, Simon Musall, Björn Kampa, Michael Schaub, RWTH Aachen, Germany
SPTM-L1.2: PRIVACY LEAKAGE IN GRAPH SIGNAL TO GRAPH MATCHING PROBLEMS
Hang Liu, Anna Scaglione, Cornell University, United States of America; Sean Peisert, Lawrence Berkeley National Laboratory, United States of America
SPTM-L1.3: IRREGULARITY-AWARE BANDLIMITED APPROXIMATION FOR GRAPH SIGNAL INTERPOLATION
Darukeesan Pakiyarajah, Eduardo Pavez, Antonio Ortega, University of Southern California, United States of America
SPTM-L1.4: A GRAPH-PREDICTION-BASED APPROACH FOR DEBIASING UNDERREPORTED DATA
Hanyang Jiang, Yao Xie, Georgia institute of Technology, United States of America
SPTM-L1.5: LEARNING SIGNALS AND GRAPHS FROM TIME-SERIES GRAPH DATA WITH FEW CAUSES
Panagiotis Misiakos, Vedran Mihal, PhD student at ETH Zurich, Switzerland; Markus Püschel, Professor at ETH Zurich, Switzerland
SPTM-L1.6: Inferring Time Varying Signals Over Uncertain Graphs
Mohammad Sabbaqi, Elvin Isufi, Delft University of Technology, Netherlands
Contacts