Learning Signed Graphs from Data

Signed graphs have recently been found to offer advantages over unsigned graphs in a variety of tasks. However, the problem of learning graph topologies has only been considered for the unsigned case. In this paper, we propose a conceptually simple and flexible approach to signed graph learning via signed smoothness metrics. Learning the graph amounts to solving a convex optimization problem, which we show can be reduced to an efficiently solvable quadratic problem. Applications to signal reconstruction and clustering corroborate the effectiveness of the proposed method.

[1]  Santiago Segarra,et al.  Network Topology Inference from Spectral Templates , 2016, IEEE Transactions on Signal and Information Processing over Networks.

[2]  Antonio Ortega,et al.  Generalized Laplacian precision matrix estimation for graph signal processing , 2016, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[3]  Shih-Fu Chang,et al.  Graph construction and b-matching for semi-supervised learning , 2009, ICML '09.

[4]  Vassilis Kalofolias,et al.  How to Learn a Graph from Smooth Signals , 2016, AISTATS.

[5]  Sahin Albayrak,et al.  Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization , 2010, SDM.

[6]  Jon Louis Bentley,et al.  The Complexity of Finding Fixed-Radius Near Neighbors , 1977, Inf. Process. Lett..

[7]  Sunil K. Narang,et al.  Signal processing techniques for interpolation in graph structured data , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[8]  Georgios B. Giannakis,et al.  Kernel-Based Reconstruction of Graph Signals , 2016, IEEE Transactions on Signal Processing.

[9]  Daniel A. Spielman,et al.  Fitting a graph to vector data , 2009, ICML '09.

[10]  Yuji Matsumoto,et al.  Using the Mutual k-Nearest Neighbor Graphs for Semi-supervised Classification on Natural Language Data , 2011, CoNLL.

[11]  Xavier Bresson,et al.  Multiclass Total Variation Clustering , 2013, NIPS.

[12]  Stephen J. Wright,et al.  Dissimilarity in Graph-Based Semi-Supervised Classification , 2007, AISTATS.

[13]  Gerald Matz,et al.  SEMI-SUPERVISED CLUSTERING BASED ON SIGNED TOTAL VARIATION , 2018, 2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[14]  Santiago Segarra,et al.  Sampling of Graph Signals With Successive Local Aggregations , 2015, IEEE Transactions on Signal Processing.

[15]  Avrim Blum,et al.  Learning from Labeled and Unlabeled Data using Graph Mincuts , 2001, ICML.

[16]  Magnus Jansson,et al.  A connectedness constraint for learning sparse graphs , 2017, 2017 25th European Signal Processing Conference (EUSIPCO).

[17]  Gerald Matz,et al.  Graph Learning Based on Total Variation Minimization , 2018, 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[18]  Alfred O. Hero,et al.  Learning sparse graphs under smoothness prior , 2016, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[19]  Matthias Hein,et al.  Estimation of positive definite M-matrices and structure learning for attractive Gaussian Markov Random fields , 2014, 1404.6640.

[20]  Jelena Kovacevic,et al.  Discrete Signal Processing on Graphs: Sampling Theory , 2015, IEEE Transactions on Signal Processing.

[21]  Sergio Barbarossa,et al.  Signals on Graphs: Uncertainty Principle and Sampling , 2015, IEEE Transactions on Signal Processing.

[22]  Fei Wang,et al.  Label Propagation through Linear Neighborhoods , 2006, IEEE Transactions on Knowledge and Data Engineering.

[23]  Sergio Barbarossa,et al.  Graph topology inference based on transform learning , 2016, 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[24]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[25]  Gerald Matz,et al.  Clustering on Dynamic Graphs Based on Total Variation , 2019, 2019 13th International conference on Sampling Theory and Applications (SampTA).

[26]  Ian Davidson,et al.  On constrained spectral clustering and its applications , 2012, Data Mining and Knowledge Discovery.

[27]  Gerald Matz,et al.  Efficient Graph Learning From Noisy and Incomplete Data , 2020, IEEE Transactions on Signal and Information Processing over Networks.

[28]  Risi Kondor,et al.  Diffusion kernels on graphs and other discrete structures , 2002, ICML 2002.

[29]  Wei Liu,et al.  Robust and Scalable Graph-Based Semisupervised Learning , 2012, Proceedings of the IEEE.

[30]  Nathanael Perraudin,et al.  Large Scale Graph Learning from Smooth Signals , 2017, ICLR.

[31]  Pengfei Liu,et al.  Local-Set-Based Graph Signal Reconstruction , 2014, IEEE Transactions on Signal Processing.

[32]  Antonio Ortega,et al.  Graph Learning From Data Under Laplacian and Structural Constraints , 2016, IEEE Journal of Selected Topics in Signal Processing.

[33]  Michael G. Rabbat,et al.  Characterization and Inference of Graph Diffusion Processes From Observations of Stationary Signals , 2016, IEEE Transactions on Signal and Information Processing over Networks.

[34]  Pascal Frossard,et al.  Learning Laplacian Matrix in Smooth Graph Signal Representations , 2014, IEEE Transactions on Signal Processing.

[35]  Antonio Ortega,et al.  A probabilistic interpretation of sampling theory of graph signals , 2015, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[36]  Gerald Matz,et al.  Semi-supervised Multiclass Clustering Based on Signed Total Variation , 2019, ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[37]  Mikhail Belkin,et al.  Regularization and Semi-supervised Learning on Large Graphs , 2004, COLT.