Relation2vec: Contextualized network embedding for heterogeneous information networks

Zeng, Ziheng

Permalink

https://hdl.handle.net/2142/106491 Copy

Description

Title

Relation2vec: Contextualized network embedding for heterogeneous information networks

Author(s)

Zeng, Ziheng

Issue Date

2019-12-09

Director of Research (if dissertation) or Advisor (if thesis)

Vasudevan, Shobha

Department of Study

Electrical & Computer Eng

Discipline

Electrical & Computer Engr

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

M.S.

Degree Level

Thesis

Keyword(s)

• heterogeneous information networks
• network embedding
• meta-path based
• graph representation learning

Abstract

From biology to sociology, network theory has been used as a tool for modeling the relationships among entities in complex systems. However, with the emergence of big data, applying the conventional network analysis algorithms, which are often combinatorial, to the contemporary networks is challenging due to the sheer size of the present day network data. On the other hand, deep neural networks (DNNs) have been exceptionally successful at learning from big data and achieved superhuman performance in the fields of computer vision and natural language processing. Hence, there is an opportunity to harness the power of DNNs for network analysis. Since DNNs require their inputs to be in the form of real-valued vectors, we need to use network embedding techniques to generate low-dimensional vectorized representations of the network that accurately encode the rich information and features that are relevant to the network analysis task. In this thesis, we present relation2vec, a contextualized network embedding method for heterogeneous information networks (HINs), in which there are more than one type of nodes and edges. Our method leverages the idea of meta-path, which allows a high-level abstraction of paths and denotes complex relationships among the nodes, to provide context for the nodes in the network, and then utilizes DNN, specifically, bi-directional long short-term memory, to encode the contextual information for each node, along with other rich information and heterogeneity, in the embeddings for both nodes and paths in HINs. We evaluate the performance of relation2vec across DBLP and Yelp datasets via four network analysis tasks: visualization, clustering purity test, node type prediction and path type prediction. The experiment results show that rela- tion2vec outperforms other state-of-the-art HIN embedding methods by 17% to 33% for average cluster purity and on average 0.36 for DBLP and 0.16 for Yelp in f-score for path type prediction. The performance of node type prediction is also competitive with the state of the art.

Graduation Semester

2019-12

Type of Resource

text

Permalink

http://hdl.handle.net/2142/106491

Copyright and License Information

Copyright 2019 Ziheng Zeng

Owning Collections