SubRank: Subgraph Embeddings via a Subgraph Proximity Measure

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Representation learning for graph data has gained a lot of attention in recent years. However, state-of-the-art research is focused mostly on node embeddings, with little effort dedicated to the closely related task of computing subgraph embeddings. Subgraph embeddings have many applications, such as community detection, cascade prediction, and question answering. In this work, we propose a subgraph to subgraph proximity measure as a building block for a subgraph embedding framework. Experiments on real-world datasets show that our approach, SubRank, outperforms state-of-the-art methods on several important data mining tasks.

Original languageEnglish
Title of host publicationAdvances in Knowledge Discovery and Data Mining - 24th Pacific-Asia Conference, PAKDD 2020, Proceedings
EditorsHady W. Lauw, Ee-Peng Lim, Raymond Chi-Wing Wong, Alexandros Ntoulas, See-Kiong Ng, Sinno Jialin Pan
PublisherSpringer
Pages487-498
Number of pages12
ISBN (Print)9783030474256
DOIs
Publication statusPublished - 1 Jan 2020
Event24th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2020 - Singapore, Singapore
Duration: 11 May 202014 May 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12084 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2020
Country/TerritorySingapore
CitySingapore
Period11/05/2014/05/20

Keywords

  • Personalized PageRank
  • Subgraph embeddings

Fingerprint

Dive into the research topics of 'SubRank: Subgraph Embeddings via a Subgraph Proximity Measure'. Together they form a unique fingerprint.

Cite this