Adaptive diffusions for scalable learning over graphs

Research output: Contribution to journalArticle

1 Citation (Scopus)

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, which can be specific to the underlying graph, and potentially different for each class. This paper 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, which rely on node embeddings and deep neural networks.

Original languageEnglish (US)
Article number8590776
Pages (from-to)1307-1321
Number of pages15
JournalIEEE Transactions on Signal Processing
Volume67
Issue number5
DOIs
StatePublished - Mar 1 2019

Fingerprint

Labels
Classifiers
Landing
Scalability
Topology
Hot Temperature
Deep neural networks

Keywords

  • Diffusions
  • Random walks
  • Semi-supervised classification

Cite this

Adaptive diffusions for scalable learning over graphs. / Berberidis, Dimitris; Nikolakopoulos, Athanasios N.; Giannakis, Georgios B.

In: IEEE Transactions on Signal Processing, Vol. 67, No. 5, 8590776, 01.03.2019, p. 1307-1321.

Research output: Contribution to journalArticle

@article{70fcfb2b3ac6422da8506f4bbeed2323,
title = "Adaptive diffusions for scalable learning over graphs",
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, which can be specific to the underlying graph, and potentially different for each class. This paper 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, which rely on node embeddings and deep neural networks.",
keywords = "Diffusions, Random walks, Semi-supervised classification",
author = "Dimitris Berberidis and Nikolakopoulos, {Athanasios N.} and Giannakis, {Georgios B.}",
year = "2019",
month = "3",
day = "1",
doi = "10.1109/TSP.2018.2889984",
language = "English (US)",
volume = "67",
pages = "1307--1321",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "5",

}

TY - JOUR

T1 - Adaptive diffusions for scalable learning over graphs

AU - Berberidis, Dimitris

AU - Nikolakopoulos, Athanasios N.

AU - Giannakis, Georgios B.

PY - 2019/3/1

Y1 - 2019/3/1

N2 - 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, which can be specific to the underlying graph, and potentially different for each class. This paper 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, which rely on node embeddings and deep neural networks.

AB - 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, which can be specific to the underlying graph, and potentially different for each class. This paper 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, which rely on node embeddings and deep neural networks.

KW - Diffusions

KW - Random walks

KW - Semi-supervised classification

UR - http://www.scopus.com/inward/record.url?scp=85059251714&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85059251714&partnerID=8YFLogxK

U2 - 10.1109/TSP.2018.2889984

DO - 10.1109/TSP.2018.2889984

M3 - Article

AN - SCOPUS:85059251714

VL - 67

SP - 1307

EP - 1321

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 5

M1 - 8590776

ER -