@inproceedings{187b3a32d0c14a20905df0b287cd5ad2,
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",
series = "International Conference on Information and Knowledge Management, Proceedings",
pages = "1673--1676",
booktitle = "ACM 18th International Conference on Information and Knowledge Management, CIKM 2009",
note = "ACM 18th International Conference on Information and Knowledge Management, CIKM 2009 ; Conference date: 02-11-2009 Through 06-11-2009",
}