Adaptive Diffusions for Scalable Learning Over Graphs
- 27 December 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 67 (5) , 1307-1321
Abstract
Diffusion-based classifiers such as those relying on the Personalized PageRank and the Heat kernel, enjoy remarkable classification accuracy at modest computational requirements. Their performance however is affected by the extent to which the chosen diffusion captures a typically unknown label propagation mechanism, that can be specific to the underlying graph, and potentially different for each class. The present work introduces a disciplined, data-efficient approach to learning class-specific diffusion functions adapted to the underlying network topology. The novel learning approach leverages the notion of "landing probabilities" of class-specific random walks, which can be computed efficiently, thereby ensuring scalability to large graphs. This is supported by rigorous analysis of the properties of the model as well as the proposed algorithms. Furthermore, a robust version of the classifier facilitates learning even in noisy environments. Classification tests on real networks demonstrate that adapting the diffusion function to the given graph and observed labels, significantly improves the performance over fixed diffusions; reaching - and many times surpassing - the classification accuracy of computationally heavier state-of-the-art competing methods, that rely on node embeddings and deep neural networks.Keywords
All Related Versions
Funding Information
- National Science Foundation (171141, 1514056, 1500713, 1442686)
This publication has 32 references indexed in Scilit:
- Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms2015
- Semi-Supervised Multiresolution Classification Using Adaptive Graph Filtering With Application to Indirect Bridge Structural Health MonitoringIEEE Transactions on Signal Processing, 2014
- Reprint of: The anatomy of a large-scale hypertextual web search engineComputer Networks, 2012
- Generalized Optimization Framework for Graph-based Semi-supervised Learning2012
- New Regularized Algorithms for Transductive Learning2009
- Random Alpha PageRankInternet Mathematics, 2009
- The heat kernel as the pagerank of a graphProceedings of the National Academy of Sciences, 2007
- Biconvex sets and optimization with biconvex functions: a survey and extensionsMathematical Methods of Operations Research, 2007
- Generic Damping Functions for Propagating Importance in Link-Based RankingInternet Mathematics, 2006
- Deeper Inside PageRankInternet Mathematics, 2004