Please use this identifier to cite or link to this item:
Title: Random walk strategies in information network representation learning
Authors: Zhou, Xuwen
Keywords: Engineering::Electrical and electronic engineering
Issue Date: 2020
Publisher: Nanyang Technological University
Project: B3055-191
Abstract: The data, informational objects, components interact with each other, forming Information Network (IN). Most current research papers make an assumption that information networks are homogeneous, whose nodes and links are of the same types. However, most of the real-world networks are Heterogeneous Information Network (HIN), a graph containing different types of nodes and links. Representation learning transforms input data and produces an expected result, which is also able to reduce the dimension of IN data and preserve important information of individual object in the IN. There are various representation learning methods in the graph and the relationship between nodes and links. In these methods, a large number of random walks will be extracted and then representation learning algorithms are applied. As different random walk strategies will greatly affect the learned representations, we need to find one with the best approach. In this project, DeepWalk and Metapath2vec are conducted to gain graph representations. By applying dblp dataset, it is compared and analyzed with their properties and impacts to representation learning. This report states the methodology and implementation details used in the experiments, followed by discussion and analysis.
Schools: School of Electrical and Electronic Engineering 
Research Centres: Centre for Advanced Media Technology 
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
  Restricted Access
3.04 MBAdobe PDFView/Open

Page view(s)

Updated on Jun 20, 2024


Updated on Jun 20, 2024

Google ScholarTM


Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.