Semantic proximity search on heterogeneous graph by proximity embedding

Zemin Liu, Vincent W. Zheng, Zhou Zhao, Fanwei Zhu, Kevin Chen-Chuan Chang, Minghui Wu, Jing Ying

Research output: Contribution to conferencePaper

Abstract

Many real-world networks have a rich collection of objects. The semantics of these objects allows us to capture different classes of proximities, thus enabling an important task of semantic proximity search. As the core of semantic proximity search, we have to measure the proximity on a heterogeneous graph, whose nodes are various types of objects. Most of the existing methods rely on engineering features about the graph structure between two nodes to measure their proximity. With recent development on graph embedding, we see a good chance to avoid feature engineering for semantic proximity search. There is very little work on using graph embedding for semantic proximity search. We also observe that graph embedding methods typically focus on embedding nodes, which is an "indirect" approach to learn the proximity. Thus, we introduce a new concept of proximity embedding, which directly embeds the network structure between two possibly distant nodes. We also design our proximity embedding, so as to flexibly support both symmetric and asymmetric proximities. Based on the proximity embedding, we can easily estimate the proximity score between two nodes and enable search on the graph. We evaluate our proximity embedding method on three real-world public data sets, and show it outperforms the state-of-the-art baselines. We release the code for proximity embedding1.

Original languageEnglish (US)
Pages154-160
Number of pages7
StatePublished - Jan 1 2017
Event31st AAAI Conference on Artificial Intelligence, AAAI 2017 - San Francisco, United States
Duration: Feb 4 2017Feb 10 2017

Other

Other31st AAAI Conference on Artificial Intelligence, AAAI 2017
CountryUnited States
CitySan Francisco
Period2/4/172/10/17

Fingerprint

Semantics

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Liu, Z., Zheng, V. W., Zhao, Z., Zhu, F., Chang, K. C-C., Wu, M., & Ying, J. (2017). Semantic proximity search on heterogeneous graph by proximity embedding. 154-160. Paper presented at 31st AAAI Conference on Artificial Intelligence, AAAI 2017, San Francisco, United States.

Semantic proximity search on heterogeneous graph by proximity embedding. / Liu, Zemin; Zheng, Vincent W.; Zhao, Zhou; Zhu, Fanwei; Chang, Kevin Chen-Chuan; Wu, Minghui; Ying, Jing.

2017. 154-160 Paper presented at 31st AAAI Conference on Artificial Intelligence, AAAI 2017, San Francisco, United States.

Research output: Contribution to conferencePaper

Liu, Z, Zheng, VW, Zhao, Z, Zhu, F, Chang, KC-C, Wu, M & Ying, J 2017, 'Semantic proximity search on heterogeneous graph by proximity embedding' Paper presented at 31st AAAI Conference on Artificial Intelligence, AAAI 2017, San Francisco, United States, 2/4/17 - 2/10/17, pp. 154-160.
Liu Z, Zheng VW, Zhao Z, Zhu F, Chang KC-C, Wu M et al. Semantic proximity search on heterogeneous graph by proximity embedding. 2017. Paper presented at 31st AAAI Conference on Artificial Intelligence, AAAI 2017, San Francisco, United States.
Liu, Zemin ; Zheng, Vincent W. ; Zhao, Zhou ; Zhu, Fanwei ; Chang, Kevin Chen-Chuan ; Wu, Minghui ; Ying, Jing. / Semantic proximity search on heterogeneous graph by proximity embedding. Paper presented at 31st AAAI Conference on Artificial Intelligence, AAAI 2017, San Francisco, United States.7 p.
@conference{176e29adfc2346a89bc0b80ddbb13d1a,
title = "Semantic proximity search on heterogeneous graph by proximity embedding",
abstract = "Many real-world networks have a rich collection of objects. The semantics of these objects allows us to capture different classes of proximities, thus enabling an important task of semantic proximity search. As the core of semantic proximity search, we have to measure the proximity on a heterogeneous graph, whose nodes are various types of objects. Most of the existing methods rely on engineering features about the graph structure between two nodes to measure their proximity. With recent development on graph embedding, we see a good chance to avoid feature engineering for semantic proximity search. There is very little work on using graph embedding for semantic proximity search. We also observe that graph embedding methods typically focus on embedding nodes, which is an {"}indirect{"} approach to learn the proximity. Thus, we introduce a new concept of proximity embedding, which directly embeds the network structure between two possibly distant nodes. We also design our proximity embedding, so as to flexibly support both symmetric and asymmetric proximities. Based on the proximity embedding, we can easily estimate the proximity score between two nodes and enable search on the graph. We evaluate our proximity embedding method on three real-world public data sets, and show it outperforms the state-of-the-art baselines. We release the code for proximity embedding1.",
author = "Zemin Liu and Zheng, {Vincent W.} and Zhou Zhao and Fanwei Zhu and Chang, {Kevin Chen-Chuan} and Minghui Wu and Jing Ying",
year = "2017",
month = "1",
day = "1",
language = "English (US)",
pages = "154--160",
note = "31st AAAI Conference on Artificial Intelligence, AAAI 2017 ; Conference date: 04-02-2017 Through 10-02-2017",

}

TY - CONF

T1 - Semantic proximity search on heterogeneous graph by proximity embedding

AU - Liu, Zemin

AU - Zheng, Vincent W.

AU - Zhao, Zhou

AU - Zhu, Fanwei

AU - Chang, Kevin Chen-Chuan

AU - Wu, Minghui

AU - Ying, Jing

PY - 2017/1/1

Y1 - 2017/1/1

N2 - Many real-world networks have a rich collection of objects. The semantics of these objects allows us to capture different classes of proximities, thus enabling an important task of semantic proximity search. As the core of semantic proximity search, we have to measure the proximity on a heterogeneous graph, whose nodes are various types of objects. Most of the existing methods rely on engineering features about the graph structure between two nodes to measure their proximity. With recent development on graph embedding, we see a good chance to avoid feature engineering for semantic proximity search. There is very little work on using graph embedding for semantic proximity search. We also observe that graph embedding methods typically focus on embedding nodes, which is an "indirect" approach to learn the proximity. Thus, we introduce a new concept of proximity embedding, which directly embeds the network structure between two possibly distant nodes. We also design our proximity embedding, so as to flexibly support both symmetric and asymmetric proximities. Based on the proximity embedding, we can easily estimate the proximity score between two nodes and enable search on the graph. We evaluate our proximity embedding method on three real-world public data sets, and show it outperforms the state-of-the-art baselines. We release the code for proximity embedding1.

AB - Many real-world networks have a rich collection of objects. The semantics of these objects allows us to capture different classes of proximities, thus enabling an important task of semantic proximity search. As the core of semantic proximity search, we have to measure the proximity on a heterogeneous graph, whose nodes are various types of objects. Most of the existing methods rely on engineering features about the graph structure between two nodes to measure their proximity. With recent development on graph embedding, we see a good chance to avoid feature engineering for semantic proximity search. There is very little work on using graph embedding for semantic proximity search. We also observe that graph embedding methods typically focus on embedding nodes, which is an "indirect" approach to learn the proximity. Thus, we introduce a new concept of proximity embedding, which directly embeds the network structure between two possibly distant nodes. We also design our proximity embedding, so as to flexibly support both symmetric and asymmetric proximities. Based on the proximity embedding, we can easily estimate the proximity score between two nodes and enable search on the graph. We evaluate our proximity embedding method on three real-world public data sets, and show it outperforms the state-of-the-art baselines. We release the code for proximity embedding1.

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

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

M3 - Paper

AN - SCOPUS:85030465314

SP - 154

EP - 160

ER -