iPoG: Fast Interactive Proximity Querying on Graphs

, and
ACM Conference on Information and Knowledge Management (CIKM)
Hong Kong, China,
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. Proximity, scalability, graph mining
Bibtex. 
@inproceedings{jamjoom-CIKM-09,
author = {Hanghang and Tong and Huiming and Qu and Hani Jamjoom and Faloutsos},
title = {{iPoG: Fast Interactive Proximity Querying on Graphs}},
booktitle = {ACM Conference on Information and Knowledge Management (CIKM)},
address = {Hong Kong, China},
month = {November},
year = {2009}
}