Measuring proximity on graphs with side information

Hanghang Tong, Huiming Qu, Hani Jamjoom

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

6 Citations (Scopus)

Abstract

This paper studies how to incorporate side information (such as users' feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studied random walk with restart (RWR). The basic idea behind ProSIN is to leverage side information to refine the graph structure so that the random walk is biased towards/away from some specific zones on the graph. Our case studies demonstrate that ProSIN is well-suited in a variety of applications, including neighborhood search, center-piece subgraphs, and image caption. Given the potential computational complexity of ProSIN, we also propose a fast algorithm (Fast-ProSIN) that exploits the smoothness of the graph structures with/without side information. Our experimental evaluation shows that Fast-ProSIN achieves significant speedups (up to 49x) over straightforward implementations.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Conference on Data Mining, ICDM
Pages598-607
Number of pages10
DOIs
StatePublished - 2008
Externally publishedYes
Event8th IEEE International Conference on Data Mining, ICDM 2008 - Pisa, Italy
Duration: Dec 15 2008Dec 19 2008

Other

Other8th IEEE International Conference on Data Mining, ICDM 2008
CountryItaly
CityPisa
Period12/15/0812/19/08

Fingerprint

Computational complexity
Feedback

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Tong, H., Qu, H., & Jamjoom, H. (2008). Measuring proximity on graphs with side information. In Proceedings - IEEE International Conference on Data Mining, ICDM (pp. 598-607). [4781155] https://doi.org/10.1109/ICDM.2008.42

Measuring proximity on graphs with side information. / Tong, Hanghang; Qu, Huiming; Jamjoom, Hani.

Proceedings - IEEE International Conference on Data Mining, ICDM. 2008. p. 598-607 4781155.

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

Tong, H, Qu, H & Jamjoom, H 2008, Measuring proximity on graphs with side information. in Proceedings - IEEE International Conference on Data Mining, ICDM., 4781155, pp. 598-607, 8th IEEE International Conference on Data Mining, ICDM 2008, Pisa, Italy, 12/15/08. https://doi.org/10.1109/ICDM.2008.42
Tong H, Qu H, Jamjoom H. Measuring proximity on graphs with side information. In Proceedings - IEEE International Conference on Data Mining, ICDM. 2008. p. 598-607. 4781155 https://doi.org/10.1109/ICDM.2008.42
Tong, Hanghang ; Qu, Huiming ; Jamjoom, Hani. / Measuring proximity on graphs with side information. Proceedings - IEEE International Conference on Data Mining, ICDM. 2008. pp. 598-607
@inproceedings{ea11c976adfe403085fcaf3eb68615ed,
title = "Measuring proximity on graphs with side information",
abstract = "This paper studies how to incorporate side information (such as users' feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studied random walk with restart (RWR). The basic idea behind ProSIN is to leverage side information to refine the graph structure so that the random walk is biased towards/away from some specific zones on the graph. Our case studies demonstrate that ProSIN is well-suited in a variety of applications, including neighborhood search, center-piece subgraphs, and image caption. Given the potential computational complexity of ProSIN, we also propose a fast algorithm (Fast-ProSIN) that exploits the smoothness of the graph structures with/without side information. Our experimental evaluation shows that Fast-ProSIN achieves significant speedups (up to 49x) over straightforward implementations.",
author = "Hanghang Tong and Huiming Qu and Hani Jamjoom",
year = "2008",
doi = "10.1109/ICDM.2008.42",
language = "English (US)",
isbn = "9780769535029",
pages = "598--607",
booktitle = "Proceedings - IEEE International Conference on Data Mining, ICDM",

}

TY - GEN

T1 - Measuring proximity on graphs with side information

AU - Tong, Hanghang

AU - Qu, Huiming

AU - Jamjoom, Hani

PY - 2008

Y1 - 2008

N2 - This paper studies how to incorporate side information (such as users' feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studied random walk with restart (RWR). The basic idea behind ProSIN is to leverage side information to refine the graph structure so that the random walk is biased towards/away from some specific zones on the graph. Our case studies demonstrate that ProSIN is well-suited in a variety of applications, including neighborhood search, center-piece subgraphs, and image caption. Given the potential computational complexity of ProSIN, we also propose a fast algorithm (Fast-ProSIN) that exploits the smoothness of the graph structures with/without side information. Our experimental evaluation shows that Fast-ProSIN achieves significant speedups (up to 49x) over straightforward implementations.

AB - This paper studies how to incorporate side information (such as users' feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studied random walk with restart (RWR). The basic idea behind ProSIN is to leverage side information to refine the graph structure so that the random walk is biased towards/away from some specific zones on the graph. Our case studies demonstrate that ProSIN is well-suited in a variety of applications, including neighborhood search, center-piece subgraphs, and image caption. Given the potential computational complexity of ProSIN, we also propose a fast algorithm (Fast-ProSIN) that exploits the smoothness of the graph structures with/without side information. Our experimental evaluation shows that Fast-ProSIN achieves significant speedups (up to 49x) over straightforward implementations.

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

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

U2 - 10.1109/ICDM.2008.42

DO - 10.1109/ICDM.2008.42

M3 - Conference contribution

AN - SCOPUS:67049167774

SN - 9780769535029

SP - 598

EP - 607

BT - Proceedings - IEEE International Conference on Data Mining, ICDM

ER -