BASSET: Scalable gateway finder in large graphs

Hanghang Tong, Spiros Papadimitriou, Christos Faloutsos, Philip S. Yu, Tina Eliassi-Rad

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Given a social network, who is the best person to introduce you to, say, Chris Ferguson, the poker champion? Or, given a network of people and skills, who is the best person to help you learn about, say, wavelets? The goal is to find a small group of 'gateways': persons who is close enough to us, as well as close enough to the target (person, or skill) or, in other words, are crucial in connecting us to the target. The main contributions are the following: (a) we show how to formulate this problem precisely; (b) we show that it is sub-modular and thus it can be solved near-optimally; (c) we give fast, scalable algorithms to find such gateways. Experiments on real data sets validate the effectiveness and efficiency of the proposed methods, achieving up to 6,000,000x speedup.

Original languageEnglish (US)
Title of host publicationAdvances in Knowledge Discovery and Data Mining - 14th Pacific-Asia Conference, PAKDD 2010, Proceedings
Number of pages15
EditionPART 2
StatePublished - 2010
Event14th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2010 - Hyderabad, India
Duration: Jun 21 2010Jun 24 2010

Publication series

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


Other14th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2010


  • Gateway
  • Graph-Mining
  • Scalability
  • Sub-modularity

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'BASSET: Scalable gateway finder in large graphs'. Together they form a unique fingerprint.

Cite this