IPoG

Fast interactive proximity querying on graphs

Hanghang Tong, Huiming Qu, Hani Jamjoom, Christos Faloutsos

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

7 Citations (Scopus)

Abstract

Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user provides additional yes/no type of feedback (e.g., what are the most related conferences for John Smith given that he does not like ICML?)? Given the potential computational complexity, we mainly devote ourselves to addressing the computational issues in this paper by proposing an efficient solution (referred to as iPoG-B) for bipartite graphs. Our experimental results show that the proposed fast solution (iPoGB) achieves significant speedup, while leading to the same ranking result.

Original languageEnglish (US)
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
Pages1673-1676
Number of pages4
DOIs
StatePublished - 2009
Externally publishedYes
EventACM 18th International Conference on Information and Knowledge Management, CIKM 2009 - Hong Kong, China
Duration: Nov 2 2009Nov 6 2009

Other

OtherACM 18th International Conference on Information and Knowledge Management, CIKM 2009
CountryChina
CityHong Kong
Period11/2/0911/6/09

Fingerprint

Ranking
Bipartite graph
Graph
Computational complexity
Proximity
Query

Keywords

  • Graph mining
  • Proximity
  • Scalability

ASJC Scopus subject areas

  • Business, Management and Accounting(all)
  • Decision Sciences(all)

Cite this

Tong, H., Qu, H., Jamjoom, H., & Faloutsos, C. (2009). IPoG: Fast interactive proximity querying on graphs. In International Conference on Information and Knowledge Management, Proceedings (pp. 1673-1676) https://doi.org/10.1145/1645953.1646201

IPoG : Fast interactive proximity querying on graphs. / Tong, Hanghang; Qu, Huiming; Jamjoom, Hani; Faloutsos, Christos.

International Conference on Information and Knowledge Management, Proceedings. 2009. p. 1673-1676.

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

Tong, H, Qu, H, Jamjoom, H & Faloutsos, C 2009, IPoG: Fast interactive proximity querying on graphs. in International Conference on Information and Knowledge Management, Proceedings. pp. 1673-1676, ACM 18th International Conference on Information and Knowledge Management, CIKM 2009, Hong Kong, China, 11/2/09. https://doi.org/10.1145/1645953.1646201
Tong H, Qu H, Jamjoom H, Faloutsos C. IPoG: Fast interactive proximity querying on graphs. In International Conference on Information and Knowledge Management, Proceedings. 2009. p. 1673-1676 https://doi.org/10.1145/1645953.1646201
Tong, Hanghang ; Qu, Huiming ; Jamjoom, Hani ; Faloutsos, Christos. / IPoG : Fast interactive proximity querying on graphs. International Conference on Information and Knowledge Management, Proceedings. 2009. pp. 1673-1676
@inproceedings{3883b36ac1f44905b925e0ba9e58ddd9,
title = "IPoG: Fast interactive proximity querying on graphs",
abstract = "Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user provides additional yes/no type of feedback (e.g., what are the most related conferences for John Smith given that he does not like ICML?)? Given the potential computational complexity, we mainly devote ourselves to addressing the computational issues in this paper by proposing an efficient solution (referred to as iPoG-B) for bipartite graphs. Our experimental results show that the proposed fast solution (iPoGB) achieves significant speedup, while leading to the same ranking result.",
keywords = "Graph mining, Proximity, Scalability",
author = "Hanghang Tong and Huiming Qu and Hani Jamjoom and Christos Faloutsos",
year = "2009",
doi = "10.1145/1645953.1646201",
language = "English (US)",
isbn = "9781605585123",
pages = "1673--1676",
booktitle = "International Conference on Information and Knowledge Management, Proceedings",

}

TY - GEN

T1 - IPoG

T2 - Fast interactive proximity querying on graphs

AU - Tong, Hanghang

AU - Qu, Huiming

AU - Jamjoom, Hani

AU - Faloutsos, Christos

PY - 2009

Y1 - 2009

N2 - Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user provides additional yes/no type of feedback (e.g., what are the most related conferences for John Smith given that he does not like ICML?)? Given the potential computational complexity, we mainly devote ourselves to addressing the computational issues in this paper by proposing an efficient solution (referred to as iPoG-B) for bipartite graphs. Our experimental results show that the proposed fast solution (iPoGB) achieves significant speedup, while leading to the same ranking result.

AB - Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user provides additional yes/no type of feedback (e.g., what are the most related conferences for John Smith given that he does not like ICML?)? Given the potential computational complexity, we mainly devote ourselves to addressing the computational issues in this paper by proposing an efficient solution (referred to as iPoG-B) for bipartite graphs. Our experimental results show that the proposed fast solution (iPoGB) achieves significant speedup, while leading to the same ranking result.

KW - Graph mining

KW - Proximity

KW - Scalability

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

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

U2 - 10.1145/1645953.1646201

DO - 10.1145/1645953.1646201

M3 - Conference contribution

SN - 9781605585123

SP - 1673

EP - 1676

BT - International Conference on Information and Knowledge Management, Proceedings

ER -